/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 20:40:25,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 20:40:25,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 20:40:25,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 20:40:25,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 20:40:25,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 20:40:25,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 20:40:26,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 20:40:26,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 20:40:26,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 20:40:26,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 20:40:26,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 20:40:26,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 20:40:26,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 20:40:26,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 20:40:26,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 20:40:26,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 20:40:26,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 20:40:26,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 20:40:26,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 20:40:26,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 20:40:26,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 20:40:26,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 20:40:26,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 20:40:26,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 20:40:26,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 20:40:26,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 20:40:26,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 20:40:26,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 20:40:26,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 20:40:26,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 20:40:26,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 20:40:26,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 20:40:26,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 20:40:26,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 20:40:26,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 20:40:26,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 20:40:26,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 20:40:26,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 20:40:26,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 20:40:26,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 20:40:26,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2020-02-10 20:40:26,080 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 20:40:26,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 20:40:26,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 20:40:26,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 20:40:26,084 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 20:40:26,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 20:40:26,084 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 20:40:26,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 20:40:26,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 20:40:26,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 20:40:26,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 20:40:26,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 20:40:26,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 20:40:26,086 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 20:40:26,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 20:40:26,086 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 20:40:26,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 20:40:26,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 20:40:26,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 20:40:26,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 20:40:26,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 20:40:26,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:40:26,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 20:40:26,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 20:40:26,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 20:40:26,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 20:40:26,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 20:40:26,092 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-02-10 20:40:26,093 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 20:40:26,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 20:40:26,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 20:40:26,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 20:40:26,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 20:40:26,442 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 20:40:26,442 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 20:40:26,443 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl [2020-02-10 20:40:26,444 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl' [2020-02-10 20:40:26,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 20:40:26,492 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 20:40:26,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 20:40:26,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 20:40:26,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 20:40:26,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:26" (1/1) ... [2020-02-10 20:40:26,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:26" (1/1) ... [2020-02-10 20:40:26,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 20:40:26,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 20:40:26,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 20:40:26,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 20:40:26,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:26" (1/1) ... [2020-02-10 20:40:26,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:26" (1/1) ... [2020-02-10 20:40:26,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:26" (1/1) ... [2020-02-10 20:40:26,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:26" (1/1) ... [2020-02-10 20:40:26,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:26" (1/1) ... [2020-02-10 20:40:26,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:26" (1/1) ... [2020-02-10 20:40:26,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:26" (1/1) ... [2020-02-10 20:40:26,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 20:40:26,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 20:40:26,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 20:40:26,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 20:40:26,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:40:26,632 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 20:40:26,632 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 20:40:26,633 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 20:40:26,634 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 20:40:26,634 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 20:40:26,634 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 20:40:26,635 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 20:40:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 20:40:26,635 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 20:40:26,635 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 20:40:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 20:40:26,635 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 20:40:26,636 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 20:40:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 20:40:26,636 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 20:40:26,636 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 20:40:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 20:40:26,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 20:40:26,637 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 20:40:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 20:40:26,638 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 20:40:26,638 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-02-10 20:40:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-02-10 20:40:26,639 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-02-10 20:40:26,639 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-02-10 20:40:26,640 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-02-10 20:40:26,641 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-02-10 20:40:26,642 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 20:40:26,882 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 20:40:26,882 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 20:40:26,886 INFO L202 PluginConnector]: Adding new model example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:40:26 BoogieIcfgContainer [2020-02-10 20:40:26,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 20:40:26,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 20:40:26,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 20:40:26,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 20:40:26,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:26" (1/2) ... [2020-02-10 20:40:26,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d76611 and model type example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 08:40:26, skipping insertion in model container [2020-02-10 20:40:26,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:40:26" (2/2) ... [2020-02-10 20:40:26,894 INFO L109 eAbstractionObserver]: Analyzing ICFG example_8.bpl [2020-02-10 20:40:26,904 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 20:40:26,905 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 20:40:26,911 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 20:40:26,912 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 20:40:27,105 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-02-10 20:40:27,123 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 20:40:27,123 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 20:40:27,123 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 20:40:27,123 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 20:40:27,123 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 20:40:27,124 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 20:40:27,124 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 20:40:27,124 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 20:40:27,139 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 99 transitions [2020-02-10 20:40:27,140 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 68 places, 99 transitions [2020-02-10 20:40:27,525 INFO L129 PetriNetUnfolder]: 769/1051 cut-off events. [2020-02-10 20:40:27,525 INFO L130 PetriNetUnfolder]: For 1024/1024 co-relation queries the response was YES. [2020-02-10 20:40:27,544 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-02-10 20:40:27,568 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 68 places, 99 transitions [2020-02-10 20:40:27,823 INFO L129 PetriNetUnfolder]: 769/1051 cut-off events. [2020-02-10 20:40:27,824 INFO L130 PetriNetUnfolder]: For 1024/1024 co-relation queries the response was YES. [2020-02-10 20:40:27,835 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-02-10 20:40:27,864 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1904 [2020-02-10 20:40:27,865 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-02-10 20:40:28,026 INFO L206 etLargeBlockEncoding]: Checked pairs total: 532 [2020-02-10 20:40:28,026 INFO L214 etLargeBlockEncoding]: Total number of compositions: 9 [2020-02-10 20:40:28,030 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 90 transitions [2020-02-10 20:40:28,727 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6818 states. [2020-02-10 20:40:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 6818 states. [2020-02-10 20:40:28,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:28,799 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:28,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-02-10 20:40:28,800 INFO L427 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-02-10 20:40:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:28,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1176015965, now seen corresponding path program 1 times [2020-02-10 20:40:28,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:28,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843981564] [2020-02-10 20:40:28,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:28,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843981564] [2020-02-10 20:40:28,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:28,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:28,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978857980] [2020-02-10 20:40:29,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:29,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:29,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:29,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:29,023 INFO L87 Difference]: Start difference. First operand 6818 states. Second operand 3 states. [2020-02-10 20:40:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:29,239 INFO L93 Difference]: Finished difference Result 6690 states and 34994 transitions. [2020-02-10 20:40:29,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:29,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 20:40:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:29,344 INFO L225 Difference]: With dead ends: 6690 [2020-02-10 20:40:29,344 INFO L226 Difference]: Without dead ends: 6689 [2020-02-10 20:40:29,346 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:29,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6689 states. [2020-02-10 20:40:29,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6689 to 6689. [2020-02-10 20:40:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6689 states. [2020-02-10 20:40:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 34993 transitions. [2020-02-10 20:40:30,375 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 34993 transitions. Word has length 25 [2020-02-10 20:40:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:30,377 INFO L479 AbstractCegarLoop]: Abstraction has 6689 states and 34993 transitions. [2020-02-10 20:40:30,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 34993 transitions. [2020-02-10 20:40:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:30,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:30,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-02-10 20:40:30,408 INFO L427 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-02-10 20:40:30,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:30,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1467806563, now seen corresponding path program 1 times [2020-02-10 20:40:30,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:30,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819869277] [2020-02-10 20:40:30,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:30,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819869277] [2020-02-10 20:40:30,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:30,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:30,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717018536] [2020-02-10 20:40:30,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:30,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:30,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:30,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:30,453 INFO L87 Difference]: Start difference. First operand 6689 states and 34993 transitions. Second operand 3 states. [2020-02-10 20:40:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:30,557 INFO L93 Difference]: Finished difference Result 4881 states and 24065 transitions. [2020-02-10 20:40:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:30,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 20:40:30,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:30,615 INFO L225 Difference]: With dead ends: 4881 [2020-02-10 20:40:30,616 INFO L226 Difference]: Without dead ends: 4881 [2020-02-10 20:40:30,617 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2020-02-10 20:40:30,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 4881. [2020-02-10 20:40:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4881 states. [2020-02-10 20:40:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 24065 transitions. [2020-02-10 20:40:30,862 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 24065 transitions. Word has length 25 [2020-02-10 20:40:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:30,863 INFO L479 AbstractCegarLoop]: Abstraction has 4881 states and 24065 transitions. [2020-02-10 20:40:30,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 24065 transitions. [2020-02-10 20:40:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:30,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:30,883 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:30,883 INFO L427 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-02-10 20:40:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:30,884 INFO L82 PathProgramCache]: Analyzing trace with hash -795426887, now seen corresponding path program 1 times [2020-02-10 20:40:30,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:30,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536270789] [2020-02-10 20:40:30,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:30,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536270789] [2020-02-10 20:40:30,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:30,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:30,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928272361] [2020-02-10 20:40:30,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:30,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:30,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:30,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:30,927 INFO L87 Difference]: Start difference. First operand 4881 states and 24065 transitions. Second operand 3 states. [2020-02-10 20:40:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:30,980 INFO L93 Difference]: Finished difference Result 3205 states and 15221 transitions. [2020-02-10 20:40:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:30,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 20:40:30,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:31,000 INFO L225 Difference]: With dead ends: 3205 [2020-02-10 20:40:31,001 INFO L226 Difference]: Without dead ends: 3205 [2020-02-10 20:40:31,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2020-02-10 20:40:31,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 3205. [2020-02-10 20:40:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3205 states. [2020-02-10 20:40:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 15221 transitions. [2020-02-10 20:40:31,261 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 15221 transitions. Word has length 25 [2020-02-10 20:40:31,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:31,261 INFO L479 AbstractCegarLoop]: Abstraction has 3205 states and 15221 transitions. [2020-02-10 20:40:31,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 15221 transitions. [2020-02-10 20:40:31,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:31,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:31,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-02-10 20:40:31,272 INFO L427 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-02-10 20:40:31,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:31,273 INFO L82 PathProgramCache]: Analyzing trace with hash 694354523, now seen corresponding path program 1 times [2020-02-10 20:40:31,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:31,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996264746] [2020-02-10 20:40:31,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:31,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996264746] [2020-02-10 20:40:31,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:31,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:31,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230350165] [2020-02-10 20:40:31,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:31,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:31,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:31,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:31,323 INFO L87 Difference]: Start difference. First operand 3205 states and 15221 transitions. Second operand 3 states. [2020-02-10 20:40:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:31,386 INFO L93 Difference]: Finished difference Result 2757 states and 12469 transitions. [2020-02-10 20:40:31,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:31,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 20:40:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:31,400 INFO L225 Difference]: With dead ends: 2757 [2020-02-10 20:40:31,400 INFO L226 Difference]: Without dead ends: 2757 [2020-02-10 20:40:31,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2020-02-10 20:40:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2757. [2020-02-10 20:40:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2020-02-10 20:40:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 12469 transitions. [2020-02-10 20:40:31,517 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 12469 transitions. Word has length 25 [2020-02-10 20:40:31,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:31,517 INFO L479 AbstractCegarLoop]: Abstraction has 2757 states and 12469 transitions. [2020-02-10 20:40:31,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 12469 transitions. [2020-02-10 20:40:31,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:31,526 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:31,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:31,526 INFO L427 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-02-10 20:40:31,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:31,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1749585931, now seen corresponding path program 1 times [2020-02-10 20:40:31,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:31,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380111712] [2020-02-10 20:40:31,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:31,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380111712] [2020-02-10 20:40:31,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:31,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:31,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733093709] [2020-02-10 20:40:31,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:31,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:31,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:31,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:31,579 INFO L87 Difference]: Start difference. First operand 2757 states and 12469 transitions. Second operand 3 states. [2020-02-10 20:40:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:31,608 INFO L93 Difference]: Finished difference Result 1773 states and 7633 transitions. [2020-02-10 20:40:31,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:31,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 20:40:31,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:31,620 INFO L225 Difference]: With dead ends: 1773 [2020-02-10 20:40:31,621 INFO L226 Difference]: Without dead ends: 1773 [2020-02-10 20:40:31,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2020-02-10 20:40:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2020-02-10 20:40:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2020-02-10 20:40:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 7633 transitions. [2020-02-10 20:40:31,716 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 7633 transitions. Word has length 25 [2020-02-10 20:40:31,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:31,716 INFO L479 AbstractCegarLoop]: Abstraction has 1773 states and 7633 transitions. [2020-02-10 20:40:31,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:31,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 7633 transitions. [2020-02-10 20:40:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:31,723 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:31,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-02-10 20:40:31,723 INFO L427 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-02-10 20:40:31,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:31,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1906045009, now seen corresponding path program 1 times [2020-02-10 20:40:31,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:31,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535026538] [2020-02-10 20:40:31,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:31,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535026538] [2020-02-10 20:40:31,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:31,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:31,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769466613] [2020-02-10 20:40:31,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:31,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:31,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:31,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:31,786 INFO L87 Difference]: Start difference. First operand 1773 states and 7633 transitions. Second operand 3 states. [2020-02-10 20:40:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:31,812 INFO L93 Difference]: Finished difference Result 1119 states and 4673 transitions. [2020-02-10 20:40:31,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:31,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 20:40:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:31,819 INFO L225 Difference]: With dead ends: 1119 [2020-02-10 20:40:31,821 INFO L226 Difference]: Without dead ends: 1119 [2020-02-10 20:40:31,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2020-02-10 20:40:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2020-02-10 20:40:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2020-02-10 20:40:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 4673 transitions. [2020-02-10 20:40:31,887 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 4673 transitions. Word has length 25 [2020-02-10 20:40:31,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:31,888 INFO L479 AbstractCegarLoop]: Abstraction has 1119 states and 4673 transitions. [2020-02-10 20:40:31,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:31,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 4673 transitions. [2020-02-10 20:40:31,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:31,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:31,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-02-10 20:40:31,895 INFO L427 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-02-10 20:40:31,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:31,895 INFO L82 PathProgramCache]: Analyzing trace with hash -389208845, now seen corresponding path program 1 times [2020-02-10 20:40:31,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:31,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495131217] [2020-02-10 20:40:31,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:31,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495131217] [2020-02-10 20:40:31,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:31,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:31,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061234726] [2020-02-10 20:40:31,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:31,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:31,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:31,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:31,945 INFO L87 Difference]: Start difference. First operand 1119 states and 4673 transitions. Second operand 3 states. [2020-02-10 20:40:31,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:31,956 INFO L93 Difference]: Finished difference Result 767 states and 3073 transitions. [2020-02-10 20:40:31,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:31,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 20:40:31,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:31,961 INFO L225 Difference]: With dead ends: 767 [2020-02-10 20:40:31,962 INFO L226 Difference]: Without dead ends: 767 [2020-02-10 20:40:31,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:31,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2020-02-10 20:40:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2020-02-10 20:40:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2020-02-10 20:40:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 3073 transitions. [2020-02-10 20:40:31,997 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 3073 transitions. Word has length 25 [2020-02-10 20:40:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:31,999 INFO L479 AbstractCegarLoop]: Abstraction has 767 states and 3073 transitions. [2020-02-10 20:40:31,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 3073 transitions. [2020-02-10 20:40:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:32,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:32,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-02-10 20:40:32,003 INFO L427 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-02-10 20:40:32,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:32,003 INFO L82 PathProgramCache]: Analyzing trace with hash -377910571, now seen corresponding path program 1 times [2020-02-10 20:40:32,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:32,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197358650] [2020-02-10 20:40:32,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:32,476 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2020-02-10 20:40:32,667 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-02-10 20:40:32,797 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-02-10 20:40:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:32,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197358650] [2020-02-10 20:40:32,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:32,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:32,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412549811] [2020-02-10 20:40:32,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:32,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:32,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:32,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:32,808 INFO L87 Difference]: Start difference. First operand 767 states and 3073 transitions. Second operand 10 states. [2020-02-10 20:40:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:32,988 INFO L93 Difference]: Finished difference Result 1367 states and 4850 transitions. [2020-02-10 20:40:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:32,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:32,994 INFO L225 Difference]: With dead ends: 1367 [2020-02-10 20:40:32,994 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 20:40:32,994 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-02-10 20:40:33,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 20:40:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 789. [2020-02-10 20:40:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:40:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3163 transitions. [2020-02-10 20:40:33,043 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3163 transitions. Word has length 25 [2020-02-10 20:40:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:33,043 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3163 transitions. [2020-02-10 20:40:33,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3163 transitions. [2020-02-10 20:40:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:33,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:33,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:33,046 INFO L427 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-02-10 20:40:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:33,047 INFO L82 PathProgramCache]: Analyzing trace with hash 592341043, now seen corresponding path program 2 times [2020-02-10 20:40:33,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:33,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136559837] [2020-02-10 20:40:33,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:33,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:33,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136559837] [2020-02-10 20:40:33,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:33,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:33,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524469205] [2020-02-10 20:40:33,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:33,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:33,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:33,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:33,579 INFO L87 Difference]: Start difference. First operand 789 states and 3163 transitions. Second operand 10 states. [2020-02-10 20:40:33,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:33,749 INFO L93 Difference]: Finished difference Result 1369 states and 4850 transitions. [2020-02-10 20:40:33,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:33,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:33,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:33,754 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 20:40:33,755 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:40:33,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:40:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-02-10 20:40:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:40:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3153 transitions. [2020-02-10 20:40:33,799 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3153 transitions. Word has length 25 [2020-02-10 20:40:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:33,799 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3153 transitions. [2020-02-10 20:40:33,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3153 transitions. [2020-02-10 20:40:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:33,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:33,802 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:33,802 INFO L427 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-02-10 20:40:33,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:33,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1548123507, now seen corresponding path program 3 times [2020-02-10 20:40:33,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:33,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131672577] [2020-02-10 20:40:33,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:34,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131672577] [2020-02-10 20:40:34,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:34,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:34,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410360170] [2020-02-10 20:40:34,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:34,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:34,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:34,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:34,324 INFO L87 Difference]: Start difference. First operand 785 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:40:34,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:34,565 INFO L93 Difference]: Finished difference Result 1363 states and 4838 transitions. [2020-02-10 20:40:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:34,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:34,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:34,573 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 20:40:34,574 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:40:34,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:34,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:40:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 788. [2020-02-10 20:40:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:40:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3158 transitions. [2020-02-10 20:40:34,621 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3158 transitions. Word has length 25 [2020-02-10 20:40:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:34,622 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3158 transitions. [2020-02-10 20:40:34,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3158 transitions. [2020-02-10 20:40:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:34,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:34,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-02-10 20:40:34,625 INFO L427 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-02-10 20:40:34,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:34,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1766089071, now seen corresponding path program 4 times [2020-02-10 20:40:34,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:34,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203693905] [2020-02-10 20:40:34,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:35,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203693905] [2020-02-10 20:40:35,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:35,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:35,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359665602] [2020-02-10 20:40:35,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:35,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:35,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:35,074 INFO L87 Difference]: Start difference. First operand 788 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:40:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:35,242 INFO L93 Difference]: Finished difference Result 1362 states and 4833 transitions. [2020-02-10 20:40:35,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:35,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:35,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:35,249 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 20:40:35,250 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 20:40:35,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-02-10 20:40:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 20:40:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 785. [2020-02-10 20:40:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:40:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3150 transitions. [2020-02-10 20:40:35,293 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3150 transitions. Word has length 25 [2020-02-10 20:40:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:35,293 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3150 transitions. [2020-02-10 20:40:35,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3150 transitions. [2020-02-10 20:40:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:35,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:35,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-02-10 20:40:35,296 INFO L427 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-02-10 20:40:35,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:35,297 INFO L82 PathProgramCache]: Analyzing trace with hash 930966229, now seen corresponding path program 5 times [2020-02-10 20:40:35,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:35,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677145129] [2020-02-10 20:40:35,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:35,685 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 26 [2020-02-10 20:40:35,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:35,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677145129] [2020-02-10 20:40:35,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:35,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:35,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495052642] [2020-02-10 20:40:35,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:35,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:35,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:35,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:35,795 INFO L87 Difference]: Start difference. First operand 785 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:40:35,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:35,952 INFO L93 Difference]: Finished difference Result 1367 states and 4843 transitions. [2020-02-10 20:40:35,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:35,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:35,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:35,962 INFO L225 Difference]: With dead ends: 1367 [2020-02-10 20:40:35,962 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 20:40:35,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-02-10 20:40:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 20:40:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-02-10 20:40:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:40:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-02-10 20:40:36,019 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-02-10 20:40:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:36,020 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-02-10 20:40:36,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-02-10 20:40:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:36,023 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:36,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-02-10 20:40:36,023 INFO L427 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-02-10 20:40:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1753060109, now seen corresponding path program 6 times [2020-02-10 20:40:36,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:36,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527852979] [2020-02-10 20:40:36,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:36,402 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2020-02-10 20:40:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:36,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527852979] [2020-02-10 20:40:36,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:36,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:36,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487472590] [2020-02-10 20:40:36,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:36,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:36,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:36,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:36,506 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:40:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:36,705 INFO L93 Difference]: Finished difference Result 1364 states and 4834 transitions. [2020-02-10 20:40:36,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:36,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:36,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:36,709 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:40:36,709 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 20:40:36,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-02-10 20:40:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 20:40:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 782. [2020-02-10 20:40:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:40:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3142 transitions. [2020-02-10 20:40:36,754 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3142 transitions. Word has length 25 [2020-02-10 20:40:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:36,754 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3142 transitions. [2020-02-10 20:40:36,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3142 transitions. [2020-02-10 20:40:36,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:36,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:36,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-02-10 20:40:36,757 INFO L427 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-02-10 20:40:36,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:36,757 INFO L82 PathProgramCache]: Analyzing trace with hash -800396297, now seen corresponding path program 7 times [2020-02-10 20:40:36,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:36,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918141570] [2020-02-10 20:40:36,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:37,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918141570] [2020-02-10 20:40:37,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:37,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:37,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114337092] [2020-02-10 20:40:37,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:37,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:37,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:37,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:37,162 INFO L87 Difference]: Start difference. First operand 782 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:40:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:37,330 INFO L93 Difference]: Finished difference Result 1376 states and 4871 transitions. [2020-02-10 20:40:37,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:37,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:37,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:37,334 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:40:37,334 INFO L226 Difference]: Without dead ends: 1363 [2020-02-10 20:40:37,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2020-02-10 20:40:37,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 790. [2020-02-10 20:40:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:40:37,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3164 transitions. [2020-02-10 20:40:37,378 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3164 transitions. Word has length 25 [2020-02-10 20:40:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:37,378 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3164 transitions. [2020-02-10 20:40:37,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3164 transitions. [2020-02-10 20:40:37,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:37,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:37,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:37,381 INFO L427 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-02-10 20:40:37,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:37,381 INFO L82 PathProgramCache]: Analyzing trace with hash 169855317, now seen corresponding path program 8 times [2020-02-10 20:40:37,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:37,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503657461] [2020-02-10 20:40:37,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:37,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503657461] [2020-02-10 20:40:37,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:37,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:37,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369655290] [2020-02-10 20:40:37,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:37,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:37,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:37,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:37,839 INFO L87 Difference]: Start difference. First operand 790 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:40:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:38,016 INFO L93 Difference]: Finished difference Result 1378 states and 4871 transitions. [2020-02-10 20:40:38,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:38,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:38,021 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 20:40:38,022 INFO L226 Difference]: Without dead ends: 1359 [2020-02-10 20:40:38,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2020-02-10 20:40:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 786. [2020-02-10 20:40:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:40:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3153 transitions. [2020-02-10 20:40:38,072 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3153 transitions. Word has length 25 [2020-02-10 20:40:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:38,072 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3153 transitions. [2020-02-10 20:40:38,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3153 transitions. [2020-02-10 20:40:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:38,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:38,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:38,076 INFO L427 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-02-10 20:40:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1243295437, now seen corresponding path program 9 times [2020-02-10 20:40:38,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:38,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584933288] [2020-02-10 20:40:38,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:38,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584933288] [2020-02-10 20:40:38,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:38,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:38,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662783742] [2020-02-10 20:40:38,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:38,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:38,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:38,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:38,523 INFO L87 Difference]: Start difference. First operand 786 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:40:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:38,678 INFO L93 Difference]: Finished difference Result 1377 states and 4869 transitions. [2020-02-10 20:40:38,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:38,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:38,682 INFO L225 Difference]: With dead ends: 1377 [2020-02-10 20:40:38,682 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 20:40:38,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 20:40:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 790. [2020-02-10 20:40:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:40:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3160 transitions. [2020-02-10 20:40:38,721 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3160 transitions. Word has length 25 [2020-02-10 20:40:38,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:38,721 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3160 transitions. [2020-02-10 20:40:38,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3160 transitions. [2020-02-10 20:40:38,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:38,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:38,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-02-10 20:40:38,724 INFO L427 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-02-10 20:40:38,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:38,724 INFO L82 PathProgramCache]: Analyzing trace with hash -252037615, now seen corresponding path program 10 times [2020-02-10 20:40:38,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:38,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440589401] [2020-02-10 20:40:38,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:39,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440589401] [2020-02-10 20:40:39,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:39,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:39,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061070142] [2020-02-10 20:40:39,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:39,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:39,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:39,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:39,166 INFO L87 Difference]: Start difference. First operand 790 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:40:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:39,344 INFO L93 Difference]: Finished difference Result 1380 states and 4871 transitions. [2020-02-10 20:40:39,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:39,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:39,348 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 20:40:39,348 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 20:40:39,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-02-10 20:40:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 20:40:39,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 786. [2020-02-10 20:40:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:40:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3149 transitions. [2020-02-10 20:40:39,383 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3149 transitions. Word has length 25 [2020-02-10 20:40:39,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:39,384 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3149 transitions. [2020-02-10 20:40:39,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3149 transitions. [2020-02-10 20:40:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:39,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:39,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-02-10 20:40:39,386 INFO L427 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-02-10 20:40:39,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:39,387 INFO L82 PathProgramCache]: Analyzing trace with hash 834076727, now seen corresponding path program 11 times [2020-02-10 20:40:39,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:39,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676250510] [2020-02-10 20:40:39,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:39,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676250510] [2020-02-10 20:40:39,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:39,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:39,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554007792] [2020-02-10 20:40:39,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:39,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:39,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:39,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:39,821 INFO L87 Difference]: Start difference. First operand 786 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:40:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:39,974 INFO L93 Difference]: Finished difference Result 1383 states and 4879 transitions. [2020-02-10 20:40:39,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:39,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:39,977 INFO L225 Difference]: With dead ends: 1383 [2020-02-10 20:40:39,978 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:40:39,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:39,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:40:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 792. [2020-02-10 20:40:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:40:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3160 transitions. [2020-02-10 20:40:40,011 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3160 transitions. Word has length 25 [2020-02-10 20:40:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:40,012 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3160 transitions. [2020-02-10 20:40:40,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3160 transitions. [2020-02-10 20:40:40,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:40,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:40,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:40,015 INFO L427 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-02-10 20:40:40,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:40,015 INFO L82 PathProgramCache]: Analyzing trace with hash -239008653, now seen corresponding path program 12 times [2020-02-10 20:40:40,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:40,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671795140] [2020-02-10 20:40:40,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:40,481 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-02-10 20:40:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:40,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671795140] [2020-02-10 20:40:40,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:40,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:40,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788431517] [2020-02-10 20:40:40,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:40,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:40,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:40,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:40,490 INFO L87 Difference]: Start difference. First operand 792 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:40:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:40,644 INFO L93 Difference]: Finished difference Result 1384 states and 4875 transitions. [2020-02-10 20:40:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:40,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:40,648 INFO L225 Difference]: With dead ends: 1384 [2020-02-10 20:40:40,649 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:40:40,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-02-10 20:40:40,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:40:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 782. [2020-02-10 20:40:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:40:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3139 transitions. [2020-02-10 20:40:40,680 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3139 transitions. Word has length 25 [2020-02-10 20:40:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:40,680 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3139 transitions. [2020-02-10 20:40:40,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:40,680 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3139 transitions. [2020-02-10 20:40:40,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:40,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:40,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-02-10 20:40:40,683 INFO L427 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-02-10 20:40:40,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:40,683 INFO L82 PathProgramCache]: Analyzing trace with hash 703152055, now seen corresponding path program 13 times [2020-02-10 20:40:40,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:40,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825173375] [2020-02-10 20:40:40,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:41,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825173375] [2020-02-10 20:40:41,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:41,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:41,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698830385] [2020-02-10 20:40:41,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:41,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:41,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:41,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:41,074 INFO L87 Difference]: Start difference. First operand 782 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:40:41,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:41,243 INFO L93 Difference]: Finished difference Result 1364 states and 4837 transitions. [2020-02-10 20:40:41,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:41,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:41,246 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:40:41,246 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 20:40:41,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-02-10 20:40:41,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 20:40:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 788. [2020-02-10 20:40:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:40:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-02-10 20:40:41,281 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-02-10 20:40:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:41,281 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-02-10 20:40:41,281 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-02-10 20:40:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:41,282 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:41,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-02-10 20:40:41,283 INFO L427 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-02-10 20:40:41,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:41,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1683906773, now seen corresponding path program 14 times [2020-02-10 20:40:41,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:41,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906514650] [2020-02-10 20:40:41,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:41,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906514650] [2020-02-10 20:40:41,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:41,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:41,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515678825] [2020-02-10 20:40:41,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:41,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:41,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:41,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:41,700 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:40:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:41,848 INFO L93 Difference]: Finished difference Result 1363 states and 4832 transitions. [2020-02-10 20:40:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:41,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:41,852 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 20:40:41,852 INFO L226 Difference]: Without dead ends: 1348 [2020-02-10 20:40:41,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-02-10 20:40:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-02-10 20:40:41,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 785. [2020-02-10 20:40:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:40:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3147 transitions. [2020-02-10 20:40:41,890 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3147 transitions. Word has length 25 [2020-02-10 20:40:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:41,890 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3147 transitions. [2020-02-10 20:40:41,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3147 transitions. [2020-02-10 20:40:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:41,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:41,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-02-10 20:40:41,892 INFO L427 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-02-10 20:40:41,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:41,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1665781163, now seen corresponding path program 15 times [2020-02-10 20:40:41,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:41,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839616247] [2020-02-10 20:40:41,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:42,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839616247] [2020-02-10 20:40:42,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:42,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:42,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228818793] [2020-02-10 20:40:42,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:42,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:42,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:42,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:42,378 INFO L87 Difference]: Start difference. First operand 785 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:40:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:42,582 INFO L93 Difference]: Finished difference Result 1369 states and 4845 transitions. [2020-02-10 20:40:42,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:42,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:42,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:42,584 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 20:40:42,585 INFO L226 Difference]: Without dead ends: 1356 [2020-02-10 20:40:42,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-02-10 20:40:42,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-02-10 20:40:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 789. [2020-02-10 20:40:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:40:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-02-10 20:40:42,612 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-02-10 20:40:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:42,612 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-02-10 20:40:42,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-02-10 20:40:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:42,614 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:42,614 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:42,614 INFO L427 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-02-10 20:40:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:42,615 INFO L82 PathProgramCache]: Analyzing trace with hash -674523341, now seen corresponding path program 16 times [2020-02-10 20:40:42,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:42,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699357633] [2020-02-10 20:40:42,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:43,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699357633] [2020-02-10 20:40:43,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:43,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:43,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261567410] [2020-02-10 20:40:43,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:43,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:43,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:43,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:43,032 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:40:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:43,193 INFO L93 Difference]: Finished difference Result 1372 states and 4847 transitions. [2020-02-10 20:40:43,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:43,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:43,197 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 20:40:43,197 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 20:40:43,198 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:43,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 20:40:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 785. [2020-02-10 20:40:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:40:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-02-10 20:40:43,227 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-02-10 20:40:43,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:43,227 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-02-10 20:40:43,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-02-10 20:40:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:43,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:43,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:43,230 INFO L427 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-02-10 20:40:43,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:43,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1946839113, now seen corresponding path program 17 times [2020-02-10 20:40:43,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:43,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685999101] [2020-02-10 20:40:43,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:43,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685999101] [2020-02-10 20:40:43,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:43,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:43,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170603729] [2020-02-10 20:40:43,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:43,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:43,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:43,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:43,671 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:40:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:43,840 INFO L93 Difference]: Finished difference Result 1366 states and 4835 transitions. [2020-02-10 20:40:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:43,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:43,844 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 20:40:43,844 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 20:40:43,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-02-10 20:40:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 20:40:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 788. [2020-02-10 20:40:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:40:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-02-10 20:40:43,874 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-02-10 20:40:43,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:43,874 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-02-10 20:40:43,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-02-10 20:40:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:43,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:43,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:43,877 INFO L427 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-02-10 20:40:43,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:43,877 INFO L82 PathProgramCache]: Analyzing trace with hash -335898155, now seen corresponding path program 18 times [2020-02-10 20:40:43,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:43,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057800260] [2020-02-10 20:40:43,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:44,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057800260] [2020-02-10 20:40:44,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:44,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:44,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099787834] [2020-02-10 20:40:44,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:44,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:44,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:44,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:44,328 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:40:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:44,472 INFO L93 Difference]: Finished difference Result 1370 states and 4840 transitions. [2020-02-10 20:40:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:44,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:44,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:44,476 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:40:44,476 INFO L226 Difference]: Without dead ends: 1348 [2020-02-10 20:40:44,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-02-10 20:40:44,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 782. [2020-02-10 20:40:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:40:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3136 transitions. [2020-02-10 20:40:44,501 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3136 transitions. Word has length 25 [2020-02-10 20:40:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:44,502 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3136 transitions. [2020-02-10 20:40:44,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3136 transitions. [2020-02-10 20:40:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:44,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:44,504 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:44,504 INFO L427 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-02-10 20:40:44,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:44,505 INFO L82 PathProgramCache]: Analyzing trace with hash 46993459, now seen corresponding path program 19 times [2020-02-10 20:40:44,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:44,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441042627] [2020-02-10 20:40:44,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:44,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441042627] [2020-02-10 20:40:44,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:44,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:44,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484684024] [2020-02-10 20:40:44,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:44,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:44,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:44,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:44,911 INFO L87 Difference]: Start difference. First operand 782 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:40:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:45,060 INFO L93 Difference]: Finished difference Result 1372 states and 4852 transitions. [2020-02-10 20:40:45,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:45,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:45,064 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 20:40:45,064 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 20:40:45,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:45,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 20:40:45,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 788. [2020-02-10 20:40:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:40:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-02-10 20:40:45,091 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-02-10 20:40:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:45,091 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-02-10 20:40:45,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-02-10 20:40:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:45,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:45,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-02-10 20:40:45,093 INFO L427 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-02-10 20:40:45,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:45,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1657934417, now seen corresponding path program 20 times [2020-02-10 20:40:45,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:45,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847886420] [2020-02-10 20:40:45,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:45,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847886420] [2020-02-10 20:40:45,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:45,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:45,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132466058] [2020-02-10 20:40:45,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:45,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:45,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:45,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:45,550 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:40:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:45,702 INFO L93 Difference]: Finished difference Result 1369 states and 4843 transitions. [2020-02-10 20:40:45,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:45,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:45,706 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 20:40:45,706 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 20:40:45,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 20:40:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 785. [2020-02-10 20:40:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:40:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-02-10 20:40:45,737 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-02-10 20:40:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:45,737 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-02-10 20:40:45,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-02-10 20:40:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:45,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:45,740 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:45,740 INFO L427 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-02-10 20:40:45,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:45,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1553444395, now seen corresponding path program 21 times [2020-02-10 20:40:45,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:45,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706970524] [2020-02-10 20:40:45,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:46,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706970524] [2020-02-10 20:40:46,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:46,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:46,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446991516] [2020-02-10 20:40:46,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:46,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:46,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:46,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:46,145 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:40:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:46,284 INFO L93 Difference]: Finished difference Result 1379 states and 4866 transitions. [2020-02-10 20:40:46,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:46,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:46,288 INFO L225 Difference]: With dead ends: 1379 [2020-02-10 20:40:46,288 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 20:40:46,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-02-10 20:40:46,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 20:40:46,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 791. [2020-02-10 20:40:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:40:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-02-10 20:40:46,317 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-02-10 20:40:46,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:46,317 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-02-10 20:40:46,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-02-10 20:40:46,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:46,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:46,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-02-10 20:40:46,319 INFO L427 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-02-10 20:40:46,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:46,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1668437521, now seen corresponding path program 22 times [2020-02-10 20:40:46,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:46,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184107076] [2020-02-10 20:40:46,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:46,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184107076] [2020-02-10 20:40:46,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:46,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:46,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862954934] [2020-02-10 20:40:46,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:46,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:46,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:46,744 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:40:46,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:46,887 INFO L93 Difference]: Finished difference Result 1380 states and 4862 transitions. [2020-02-10 20:40:46,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:46,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:46,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:46,891 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 20:40:46,892 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:40:46,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:40:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 785. [2020-02-10 20:40:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:40:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 20:40:46,923 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 20:40:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:46,923 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 20:40:46,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 20:40:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:46,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:46,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-02-10 20:40:46,925 INFO L427 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-02-10 20:40:46,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:46,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1542941291, now seen corresponding path program 23 times [2020-02-10 20:40:46,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:46,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725094794] [2020-02-10 20:40:46,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:47,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725094794] [2020-02-10 20:40:47,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:47,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:47,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403681298] [2020-02-10 20:40:47,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:47,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:47,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:47,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:47,406 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:40:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:47,552 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-02-10 20:40:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:47,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:47,557 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:40:47,557 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:40:47,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-02-10 20:40:47,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:40:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-02-10 20:40:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:40:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 20:40:47,589 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 20:40:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:47,589 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 20:40:47,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 20:40:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:47,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:47,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-02-10 20:40:47,592 INFO L427 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-02-10 20:40:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:47,592 INFO L82 PathProgramCache]: Analyzing trace with hash 67999667, now seen corresponding path program 24 times [2020-02-10 20:40:47,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:47,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332594365] [2020-02-10 20:40:47,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40: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-02-10 20:40:48,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332594365] [2020-02-10 20:40:48,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:48,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:48,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499529126] [2020-02-10 20:40:48,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:48,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:48,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:48,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:48,049 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:40:48,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:48,199 INFO L93 Difference]: Finished difference Result 1374 states and 4847 transitions. [2020-02-10 20:40:48,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:48,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:48,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:48,202 INFO L225 Difference]: With dead ends: 1374 [2020-02-10 20:40:48,202 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 20:40:48,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-02-10 20:40:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 20:40:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 779. [2020-02-10 20:40:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:40:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3128 transitions. [2020-02-10 20:40:48,229 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3128 transitions. Word has length 25 [2020-02-10 20:40:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:48,229 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3128 transitions. [2020-02-10 20:40:48,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3128 transitions. [2020-02-10 20:40:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:48,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:48,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-02-10 20:40:48,231 INFO L427 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-02-10 20:40:48,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:48,232 INFO L82 PathProgramCache]: Analyzing trace with hash -590066189, now seen corresponding path program 25 times [2020-02-10 20:40:48,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:48,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832972189] [2020-02-10 20:40:48,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:48,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832972189] [2020-02-10 20:40:48,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:48,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:48,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844481702] [2020-02-10 20:40:48,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:48,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:48,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:48,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:48,641 INFO L87 Difference]: Start difference. First operand 779 states and 3128 transitions. Second operand 10 states. [2020-02-10 20:40:48,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:48,799 INFO L93 Difference]: Finished difference Result 1364 states and 4840 transitions. [2020-02-10 20:40:48,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:48,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:48,803 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:40:48,803 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 20:40:48,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-02-10 20:40:48,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 20:40:48,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 789. [2020-02-10 20:40:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:40:48,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3160 transitions. [2020-02-10 20:40:48,832 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3160 transitions. Word has length 25 [2020-02-10 20:40:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:48,833 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3160 transitions. [2020-02-10 20:40:48,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3160 transitions. [2020-02-10 20:40:48,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:48,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:48,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:48,835 INFO L427 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-02-10 20:40:48,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:48,836 INFO L82 PathProgramCache]: Analyzing trace with hash 380185425, now seen corresponding path program 26 times [2020-02-10 20:40:48,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:48,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13775448] [2020-02-10 20:40:48,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:49,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13775448] [2020-02-10 20:40:49,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:49,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:49,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826806005] [2020-02-10 20:40:49,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:49,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:49,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:49,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:49,364 INFO L87 Difference]: Start difference. First operand 789 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:40:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:49,502 INFO L93 Difference]: Finished difference Result 1366 states and 4840 transitions. [2020-02-10 20:40:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:49,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:49,506 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 20:40:49,506 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 20:40:49,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-02-10 20:40:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 20:40:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 785. [2020-02-10 20:40:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:40:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3150 transitions. [2020-02-10 20:40:49,546 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3150 transitions. Word has length 25 [2020-02-10 20:40:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:49,546 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3150 transitions. [2020-02-10 20:40:49,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3150 transitions. [2020-02-10 20:40:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:49,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:49,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-02-10 20:40:49,549 INFO L427 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-02-10 20:40:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1335967889, now seen corresponding path program 27 times [2020-02-10 20:40:49,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:49,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562732634] [2020-02-10 20:40:49,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:49,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562732634] [2020-02-10 20:40:49,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:49,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:49,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366533738] [2020-02-10 20:40:49,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:49,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:49,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:49,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:49,975 INFO L87 Difference]: Start difference. First operand 785 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:40:50,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:50,138 INFO L93 Difference]: Finished difference Result 1360 states and 4828 transitions. [2020-02-10 20:40:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:50,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:50,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:50,142 INFO L225 Difference]: With dead ends: 1360 [2020-02-10 20:40:50,142 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 20:40:50,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-02-10 20:40:50,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 20:40:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-02-10 20:40:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:40:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-02-10 20:40:50,169 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-02-10 20:40:50,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:50,169 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-02-10 20:40:50,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:50,170 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-02-10 20:40:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:50,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:50,171 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:50,171 INFO L427 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-02-10 20:40:50,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:50,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1978244689, now seen corresponding path program 28 times [2020-02-10 20:40:50,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:50,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122672195] [2020-02-10 20:40:50,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:50,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122672195] [2020-02-10 20:40:50,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:50,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:50,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027726026] [2020-02-10 20:40:50,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:50,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:50,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:50,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:50,599 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:40:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:50,759 INFO L93 Difference]: Finished difference Result 1359 states and 4823 transitions. [2020-02-10 20:40:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:50,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:50,763 INFO L225 Difference]: With dead ends: 1359 [2020-02-10 20:40:50,764 INFO L226 Difference]: Without dead ends: 1344 [2020-02-10 20:40:50,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-02-10 20:40:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2020-02-10 20:40:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 785. [2020-02-10 20:40:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:40:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3147 transitions. [2020-02-10 20:40:50,797 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3147 transitions. Word has length 25 [2020-02-10 20:40:50,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:50,797 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3147 transitions. [2020-02-10 20:40:50,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3147 transitions. [2020-02-10 20:40:50,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:50,799 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:50,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-02-10 20:40:50,800 INFO L427 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-02-10 20:40:50,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:50,800 INFO L82 PathProgramCache]: Analyzing trace with hash 718810611, now seen corresponding path program 29 times [2020-02-10 20:40:50,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:50,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164095843] [2020-02-10 20:40:50,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:51,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164095843] [2020-02-10 20:40:51,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:51,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:51,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096102085] [2020-02-10 20:40:51,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:51,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:51,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:51,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:51,222 INFO L87 Difference]: Start difference. First operand 785 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:40:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:51,344 INFO L93 Difference]: Finished difference Result 1364 states and 4833 transitions. [2020-02-10 20:40:51,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:51,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:51,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:51,348 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:40:51,348 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 20:40:51,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-02-10 20:40:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 20:40:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 788. [2020-02-10 20:40:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:40:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-02-10 20:40:51,385 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-02-10 20:40:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:51,386 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-02-10 20:40:51,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-02-10 20:40:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:51,388 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:51,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-02-10 20:40:51,388 INFO L427 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-02-10 20:40:51,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:51,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1965215727, now seen corresponding path program 30 times [2020-02-10 20:40:51,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:51,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041220365] [2020-02-10 20:40:51,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:51,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041220365] [2020-02-10 20:40:51,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:51,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:51,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614278427] [2020-02-10 20:40:51,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:51,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:51,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:51,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:51,836 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:40:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:51,991 INFO L93 Difference]: Finished difference Result 1361 states and 4824 transitions. [2020-02-10 20:40:51,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:51,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:51,995 INFO L225 Difference]: With dead ends: 1361 [2020-02-10 20:40:51,995 INFO L226 Difference]: Without dead ends: 1343 [2020-02-10 20:40:51,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2020-02-10 20:40:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 782. [2020-02-10 20:40:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:40:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3139 transitions. [2020-02-10 20:40:52,020 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3139 transitions. Word has length 25 [2020-02-10 20:40:52,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:52,021 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3139 transitions. [2020-02-10 20:40:52,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3139 transitions. [2020-02-10 20:40:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:52,022 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:52,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-02-10 20:40:52,022 INFO L427 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-02-10 20:40:52,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:52,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1435037641, now seen corresponding path program 31 times [2020-02-10 20:40:52,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:52,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597383153] [2020-02-10 20:40:52,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:52,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-02-10 20:40:52,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597383153] [2020-02-10 20:40:52,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:52,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:52,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782769505] [2020-02-10 20:40:52,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:52,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:52,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:52,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:52,442 INFO L87 Difference]: Start difference. First operand 782 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:40:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:52,612 INFO L93 Difference]: Finished difference Result 1370 states and 4854 transitions. [2020-02-10 20:40:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:52,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:52,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:52,616 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:40:52,616 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 20:40:52,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 20:40:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 790. [2020-02-10 20:40:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:40:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3161 transitions. [2020-02-10 20:40:52,640 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3161 transitions. Word has length 25 [2020-02-10 20:40:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:52,640 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3161 transitions. [2020-02-10 20:40:52,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3161 transitions. [2020-02-10 20:40:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:52,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:52,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-02-10 20:40:52,642 INFO L427 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-02-10 20:40:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:52,642 INFO L82 PathProgramCache]: Analyzing trace with hash -464786027, now seen corresponding path program 32 times [2020-02-10 20:40:52,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:52,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423301709] [2020-02-10 20:40:52,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:53,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423301709] [2020-02-10 20:40:53,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:53,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:53,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361178824] [2020-02-10 20:40:53,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:53,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:53,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:53,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:53,070 INFO L87 Difference]: Start difference. First operand 790 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:40:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:53,225 INFO L93 Difference]: Finished difference Result 1372 states and 4854 transitions. [2020-02-10 20:40:53,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:53,226 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:53,229 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 20:40:53,229 INFO L226 Difference]: Without dead ends: 1353 [2020-02-10 20:40:53,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-02-10 20:40:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2020-02-10 20:40:53,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 786. [2020-02-10 20:40:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:40:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3150 transitions. [2020-02-10 20:40:53,263 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3150 transitions. Word has length 25 [2020-02-10 20:40:53,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:53,264 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3150 transitions. [2020-02-10 20:40:53,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3150 transitions. [2020-02-10 20:40:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:53,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:53,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-02-10 20:40:53,266 INFO L427 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-02-10 20:40:53,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:53,267 INFO L82 PathProgramCache]: Analyzing trace with hash 48097297, now seen corresponding path program 33 times [2020-02-10 20:40:53,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:53,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289151441] [2020-02-10 20:40:53,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:53,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289151441] [2020-02-10 20:40:53,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:53,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:53,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268859760] [2020-02-10 20:40:53,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:53,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:53,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:53,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:53,684 INFO L87 Difference]: Start difference. First operand 786 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:40:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:53,842 INFO L93 Difference]: Finished difference Result 1369 states and 4848 transitions. [2020-02-10 20:40:53,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:53,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:53,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:53,846 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 20:40:53,846 INFO L226 Difference]: Without dead ends: 1356 [2020-02-10 20:40:53,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-02-10 20:40:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 790. [2020-02-10 20:40:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:40:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3157 transitions. [2020-02-10 20:40:53,872 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3157 transitions. Word has length 25 [2020-02-10 20:40:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:53,872 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3157 transitions. [2020-02-10 20:40:53,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3157 transitions. [2020-02-10 20:40:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:53,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:53,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-02-10 20:40:53,875 INFO L427 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-02-10 20:40:53,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:53,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1049858223, now seen corresponding path program 34 times [2020-02-10 20:40:53,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:53,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521884896] [2020-02-10 20:40:53,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:54,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521884896] [2020-02-10 20:40:54,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:54,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:54,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220877723] [2020-02-10 20:40:54,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:54,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:54,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:54,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:54,324 INFO L87 Difference]: Start difference. First operand 790 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:40:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:54,486 INFO L93 Difference]: Finished difference Result 1370 states and 4846 transitions. [2020-02-10 20:40:54,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:54,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:54,491 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:40:54,491 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 20:40:54,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:54,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 20:40:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 786. [2020-02-10 20:40:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:40:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3146 transitions. [2020-02-10 20:40:54,516 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3146 transitions. Word has length 25 [2020-02-10 20:40:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:54,516 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3146 transitions. [2020-02-10 20:40:54,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3146 transitions. [2020-02-10 20:40:54,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:54,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:54,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-02-10 20:40:54,518 INFO L427 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-02-10 20:40:54,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:54,518 INFO L82 PathProgramCache]: Analyzing trace with hash 525031607, now seen corresponding path program 35 times [2020-02-10 20:40:54,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:54,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222749904] [2020-02-10 20:40:54,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:54,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222749904] [2020-02-10 20:40:54,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:54,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:54,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032889922] [2020-02-10 20:40:54,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:54,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:54,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:54,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:54,947 INFO L87 Difference]: Start difference. First operand 786 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:40:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:55,093 INFO L93 Difference]: Finished difference Result 1374 states and 4855 transitions. [2020-02-10 20:40:55,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:55,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:55,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:55,097 INFO L225 Difference]: With dead ends: 1374 [2020-02-10 20:40:55,097 INFO L226 Difference]: Without dead ends: 1359 [2020-02-10 20:40:55,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-02-10 20:40:55,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2020-02-10 20:40:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 791. [2020-02-10 20:40:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:40:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-02-10 20:40:55,122 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-02-10 20:40:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:55,123 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-02-10 20:40:55,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-02-10 20:40:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:55,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:55,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:55,125 INFO L427 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-02-10 20:40:55,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:55,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1062887185, now seen corresponding path program 36 times [2020-02-10 20:40:55,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:55,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562576529] [2020-02-10 20:40:55,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:55,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562576529] [2020-02-10 20:40:55,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:55,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:55,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595833653] [2020-02-10 20:40:55,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:55,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:55,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:55,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:55,587 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:40:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:55,735 INFO L93 Difference]: Finished difference Result 1373 states and 4848 transitions. [2020-02-10 20:40:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:55,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:55,739 INFO L225 Difference]: With dead ends: 1373 [2020-02-10 20:40:55,739 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:40:55,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-02-10 20:40:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:40:55,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 782. [2020-02-10 20:40:55,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:40:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3136 transitions. [2020-02-10 20:40:55,766 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3136 transitions. Word has length 25 [2020-02-10 20:40:55,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:55,767 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3136 transitions. [2020-02-10 20:40:55,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3136 transitions. [2020-02-10 20:40:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:55,769 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:55,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-02-10 20:40:55,769 INFO L427 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-02-10 20:40:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:55,770 INFO L82 PathProgramCache]: Analyzing trace with hash 68510711, now seen corresponding path program 37 times [2020-02-10 20:40:55,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:55,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86883833] [2020-02-10 20:40:55,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:56,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86883833] [2020-02-10 20:40:56,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:56,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:56,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338512133] [2020-02-10 20:40:56,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:56,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:56,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:56,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:56,203 INFO L87 Difference]: Start difference. First operand 782 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:40:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:56,389 INFO L93 Difference]: Finished difference Result 1359 states and 4823 transitions. [2020-02-10 20:40:56,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:56,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:56,393 INFO L225 Difference]: With dead ends: 1359 [2020-02-10 20:40:56,394 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 20:40:56,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 20:40:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 788. [2020-02-10 20:40:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:40:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-02-10 20:40:56,419 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-02-10 20:40:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:56,419 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-02-10 20:40:56,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-02-10 20:40:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:56,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:56,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-02-10 20:40:56,422 INFO L427 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-02-10 20:40:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:56,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1049265429, now seen corresponding path program 38 times [2020-02-10 20:40:56,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:56,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315349409] [2020-02-10 20:40:56,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:56,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315349409] [2020-02-10 20:40:56,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:56,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:56,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663323695] [2020-02-10 20:40:56,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:56,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:56,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:56,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:56,966 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:40:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:57,099 INFO L93 Difference]: Finished difference Result 1358 states and 4818 transitions. [2020-02-10 20:40:57,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:57,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:57,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:57,103 INFO L225 Difference]: With dead ends: 1358 [2020-02-10 20:40:57,103 INFO L226 Difference]: Without dead ends: 1343 [2020-02-10 20:40:57,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-02-10 20:40:57,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2020-02-10 20:40:57,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 785. [2020-02-10 20:40:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:40:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-02-10 20:40:57,140 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-02-10 20:40:57,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:57,140 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-02-10 20:40:57,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-02-10 20:40:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:57,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:57,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-02-10 20:40:57,143 INFO L427 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-02-10 20:40:57,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:57,143 INFO L82 PathProgramCache]: Analyzing trace with hash -374388429, now seen corresponding path program 39 times [2020-02-10 20:40:57,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:57,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809021896] [2020-02-10 20:40:57,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:57,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809021896] [2020-02-10 20:40:57,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:57,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:57,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271021448] [2020-02-10 20:40:57,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:57,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:57,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:57,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:57,598 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:40:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:57,761 INFO L93 Difference]: Finished difference Result 1362 states and 4827 transitions. [2020-02-10 20:40:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:57,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:57,765 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 20:40:57,765 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 20:40:57,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:40:57,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 20:40:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 789. [2020-02-10 20:40:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:40:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-02-10 20:40:57,792 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-02-10 20:40:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:57,792 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-02-10 20:40:57,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-02-10 20:40:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:57,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:57,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:57,794 INFO L427 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-02-10 20:40:57,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:57,794 INFO L82 PathProgramCache]: Analyzing trace with hash 627372497, now seen corresponding path program 40 times [2020-02-10 20:40:57,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:57,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188830193] [2020-02-10 20:40:57,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:58,375 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 27 [2020-02-10 20:40: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-02-10 20:40:58,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188830193] [2020-02-10 20:40:58,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:58,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:58,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305387698] [2020-02-10 20:40:58,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:58,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:58,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:58,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:58,385 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:40:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:58,527 INFO L93 Difference]: Finished difference Result 1363 states and 4825 transitions. [2020-02-10 20:40:58,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:58,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:58,530 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 20:40:58,530 INFO L226 Difference]: Without dead ends: 1345 [2020-02-10 20:40:58,531 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-02-10 20:40:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2020-02-10 20:40:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 785. [2020-02-10 20:40:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:40:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 20:40:58,563 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 20:40:58,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:58,563 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 20:40:58,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 20:40:58,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:58,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:58,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:58,565 INFO L427 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-02-10 20:40:58,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2039083063, now seen corresponding path program 41 times [2020-02-10 20:40:58,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:58,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033849619] [2020-02-10 20:40:58,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:59,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033849619] [2020-02-10 20:40:59,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:59,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:59,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021490171] [2020-02-10 20:40:59,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:59,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:59,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:59,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:59,004 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:40:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:59,150 INFO L93 Difference]: Finished difference Result 1359 states and 4817 transitions. [2020-02-10 20:40:59,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:59,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:59,155 INFO L225 Difference]: With dead ends: 1359 [2020-02-10 20:40:59,155 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 20:40:59,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-02-10 20:40:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 20:40:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-02-10 20:40:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:40:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 20:40:59,182 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 20:40:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:59,182 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 20:40:59,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 20:40:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:59,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:59,183 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:59,184 INFO L427 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-02-10 20:40:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:59,184 INFO L82 PathProgramCache]: Analyzing trace with hash 965997683, now seen corresponding path program 42 times [2020-02-10 20:40:59,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:59,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270943729] [2020-02-10 20:40:59,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:59,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270943729] [2020-02-10 20:40:59,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:59,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:40:59,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148740723] [2020-02-10 20:40:59,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:40:59,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:59,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:40:59,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:40:59,604 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:40:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:59,759 INFO L93 Difference]: Finished difference Result 1361 states and 4818 transitions. [2020-02-10 20:40:59,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:40:59,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:40:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:59,763 INFO L225 Difference]: With dead ends: 1361 [2020-02-10 20:40:59,764 INFO L226 Difference]: Without dead ends: 1341 [2020-02-10 20:40:59,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-02-10 20:40:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2020-02-10 20:40:59,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 782. [2020-02-10 20:40:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:40:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-02-10 20:40:59,788 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-02-10 20:40:59,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:59,788 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-02-10 20:40:59,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:40:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-02-10 20:40:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:40:59,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:59,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-02-10 20:40:59,791 INFO L427 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-02-10 20:40:59,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:59,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1338386193, now seen corresponding path program 43 times [2020-02-10 20:40:59,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:59,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695662346] [2020-02-10 20:40:59,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:00,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695662346] [2020-02-10 20:41:00,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:00,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:00,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570037342] [2020-02-10 20:41:00,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:00,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:00,206 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:41:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:00,393 INFO L93 Difference]: Finished difference Result 1366 states and 4835 transitions. [2020-02-10 20:41:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:00,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:00,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:00,396 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 20:41:00,396 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 20:41:00,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 20:41:00,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 788. [2020-02-10 20:41:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-02-10 20:41:00,421 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-02-10 20:41:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:00,421 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-02-10 20:41:00,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-02-10 20:41:00,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:00,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:00,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-02-10 20:41:00,423 INFO L427 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-02-10 20:41:00,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:00,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1345640145, now seen corresponding path program 44 times [2020-02-10 20:41:00,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:00,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968044931] [2020-02-10 20:41:00,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:00,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:00,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968044931] [2020-02-10 20:41:00,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:00,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:00,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969166017] [2020-02-10 20:41:00,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:00,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:00,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:00,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:00,840 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:41:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:01,015 INFO L93 Difference]: Finished difference Result 1363 states and 4826 transitions. [2020-02-10 20:41:01,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:01,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:01,025 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 20:41:01,025 INFO L226 Difference]: Without dead ends: 1348 [2020-02-10 20:41:01,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-02-10 20:41:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-02-10 20:41:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 785. [2020-02-10 20:41:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 20:41:01,051 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 20:41:01,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:01,051 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 20:41:01,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:01,051 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 20:41:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:01,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:01,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-02-10 20:41:01,053 INFO L427 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-02-10 20:41:01,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:01,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1862489515, now seen corresponding path program 45 times [2020-02-10 20:41:01,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:01,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218183797] [2020-02-10 20:41:01,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:01,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218183797] [2020-02-10 20:41:01,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:01,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:01,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806285713] [2020-02-10 20:41:01,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:01,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:01,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:01,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:01,497 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:41:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:01,691 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-02-10 20:41:01,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:01,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:01,695 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:41:01,695 INFO L226 Difference]: Without dead ends: 1355 [2020-02-10 20:41:01,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:01,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-02-10 20:41:01,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 790. [2020-02-10 20:41:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:41:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-02-10 20:41:01,720 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-02-10 20:41:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:01,721 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-02-10 20:41:01,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-02-10 20:41:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:01,722 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:01,722 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:01,722 INFO L427 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-02-10 20:41:01,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:01,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1324633937, now seen corresponding path program 46 times [2020-02-10 20:41:01,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:01,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797670390] [2020-02-10 20:41:01,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:02,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797670390] [2020-02-10 20:41:02,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:02,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:02,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797463123] [2020-02-10 20:41:02,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:02,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:02,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:02,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:02,124 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:41:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:02,358 INFO L93 Difference]: Finished difference Result 1369 states and 4835 transitions. [2020-02-10 20:41:02,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:02,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:02,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:02,362 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 20:41:02,362 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:41:02,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-02-10 20:41:02,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:41:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-02-10 20:41:02,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-02-10 20:41:02,409 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-02-10 20:41:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:02,410 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-02-10 20:41:02,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-02-10 20:41:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:02,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:02,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-02-10 20:41:02,412 INFO L427 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-02-10 20:41:02,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:02,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1851986411, now seen corresponding path program 47 times [2020-02-10 20:41:02,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:02,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628039787] [2020-02-10 20:41:02,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:02,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628039787] [2020-02-10 20:41:02,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:02,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:02,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446550818] [2020-02-10 20:41:02,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:02,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:02,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:02,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:02,805 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:41:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:02,958 INFO L93 Difference]: Finished difference Result 1362 states and 4821 transitions. [2020-02-10 20:41:02,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:02,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:02,962 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 20:41:02,962 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:41:02,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-02-10 20:41:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:41:02,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 788. [2020-02-10 20:41:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-02-10 20:41:02,986 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-02-10 20:41:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:02,986 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-02-10 20:41:02,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-02-10 20:41:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:02,988 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:02,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-02-10 20:41:02,988 INFO L427 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-02-10 20:41:02,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1369895505, now seen corresponding path program 48 times [2020-02-10 20:41:02,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:02,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036253976] [2020-02-10 20:41:02,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:03,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036253976] [2020-02-10 20:41:03,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:03,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:03,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747892414] [2020-02-10 20:41:03,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:03,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:03,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:03,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:03,423 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:41:03,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:03,601 INFO L93 Difference]: Finished difference Result 1364 states and 4822 transitions. [2020-02-10 20:41:03,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:03,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:03,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:03,605 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:41:03,605 INFO L226 Difference]: Without dead ends: 1341 [2020-02-10 20:41:03,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:03,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2020-02-10 20:41:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 779. [2020-02-10 20:41:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:41:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3125 transitions. [2020-02-10 20:41:03,631 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3125 transitions. Word has length 25 [2020-02-10 20:41:03,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:03,631 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3125 transitions. [2020-02-10 20:41:03,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3125 transitions. [2020-02-10 20:41:03,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:03,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:03,633 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:03,633 INFO L427 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-02-10 20:41:03,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:03,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1224707533, now seen corresponding path program 49 times [2020-02-10 20:41:03,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:03,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295085139] [2020-02-10 20:41:03,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:04,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295085139] [2020-02-10 20:41:04,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:04,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:04,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522436139] [2020-02-10 20:41:04,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:04,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:04,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:04,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:04,129 INFO L87 Difference]: Start difference. First operand 779 states and 3125 transitions. Second operand 10 states. [2020-02-10 20:41:04,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:04,277 INFO L93 Difference]: Finished difference Result 1388 states and 4908 transitions. [2020-02-10 20:41:04,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:04,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:04,282 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 20:41:04,283 INFO L226 Difference]: Without dead ends: 1375 [2020-02-10 20:41:04,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-02-10 20:41:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 791. [2020-02-10 20:41:04,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:41:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3166 transitions. [2020-02-10 20:41:04,327 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3166 transitions. Word has length 25 [2020-02-10 20:41:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:04,327 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3166 transitions. [2020-02-10 20:41:04,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3166 transitions. [2020-02-10 20:41:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:04,328 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:04,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-02-10 20:41:04,329 INFO L427 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-02-10 20:41:04,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:04,329 INFO L82 PathProgramCache]: Analyzing trace with hash -254455919, now seen corresponding path program 50 times [2020-02-10 20:41:04,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:04,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845179142] [2020-02-10 20:41:04,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:04,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845179142] [2020-02-10 20:41:04,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:04,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:04,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40626525] [2020-02-10 20:41:04,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:04,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:04,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:04,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:04,749 INFO L87 Difference]: Start difference. First operand 791 states and 3166 transitions. Second operand 10 states. [2020-02-10 20:41:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:04,898 INFO L93 Difference]: Finished difference Result 1390 states and 4908 transitions. [2020-02-10 20:41:04,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:04,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:04,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:04,901 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:41:04,901 INFO L226 Difference]: Without dead ends: 1371 [2020-02-10 20:41:04,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-02-10 20:41:04,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-02-10 20:41:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 787. [2020-02-10 20:41:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:41:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3155 transitions. [2020-02-10 20:41:04,927 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3155 transitions. Word has length 25 [2020-02-10 20:41:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:04,928 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3155 transitions. [2020-02-10 20:41:04,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3155 transitions. [2020-02-10 20:41:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:04,929 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:04,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-02-10 20:41:04,930 INFO L427 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-02-10 20:41:04,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:04,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1667606673, now seen corresponding path program 51 times [2020-02-10 20:41:04,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:04,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874189247] [2020-02-10 20:41:04,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:05,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874189247] [2020-02-10 20:41:05,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:05,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:05,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773827319] [2020-02-10 20:41:05,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:05,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:05,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:05,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:05,349 INFO L87 Difference]: Start difference. First operand 787 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:41:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:05,496 INFO L93 Difference]: Finished difference Result 1389 states and 4906 transitions. [2020-02-10 20:41:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:05,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:05,501 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 20:41:05,501 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:41:05,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-02-10 20:41:05,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:41:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 791. [2020-02-10 20:41:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:41:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3162 transitions. [2020-02-10 20:41:05,528 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3162 transitions. Word has length 25 [2020-02-10 20:41:05,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:05,528 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3162 transitions. [2020-02-10 20:41:05,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3162 transitions. [2020-02-10 20:41:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:05,530 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:05,530 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:05,530 INFO L427 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-02-10 20:41:05,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:05,530 INFO L82 PathProgramCache]: Analyzing trace with hash -676348851, now seen corresponding path program 52 times [2020-02-10 20:41:05,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:05,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219807530] [2020-02-10 20:41:05,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:05,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219807530] [2020-02-10 20:41:05,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:05,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:05,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756066789] [2020-02-10 20:41:05,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:05,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:05,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:05,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:05,947 INFO L87 Difference]: Start difference. First operand 791 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:41:06,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:06,170 INFO L93 Difference]: Finished difference Result 1392 states and 4908 transitions. [2020-02-10 20:41:06,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:06,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:06,174 INFO L225 Difference]: With dead ends: 1392 [2020-02-10 20:41:06,174 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 20:41:06,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:06,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 20:41:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 787. [2020-02-10 20:41:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:41:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3151 transitions. [2020-02-10 20:41:06,202 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3151 transitions. Word has length 25 [2020-02-10 20:41:06,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:06,202 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3151 transitions. [2020-02-10 20:41:06,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3151 transitions. [2020-02-10 20:41:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:06,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:06,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-02-10 20:41:06,203 INFO L427 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-02-10 20:41:06,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:06,203 INFO L82 PathProgramCache]: Analyzing trace with hash 409765491, now seen corresponding path program 53 times [2020-02-10 20:41:06,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:06,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568148234] [2020-02-10 20:41:06,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:06,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568148234] [2020-02-10 20:41:06,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:06,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:06,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458790055] [2020-02-10 20:41:06,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:06,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:06,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:06,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:06,632 INFO L87 Difference]: Start difference. First operand 787 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:41:06,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:06,786 INFO L93 Difference]: Finished difference Result 1395 states and 4916 transitions. [2020-02-10 20:41:06,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:06,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:06,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:06,790 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:41:06,791 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:41:06,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-02-10 20:41:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:41:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 793. [2020-02-10 20:41:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:41:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3162 transitions. [2020-02-10 20:41:06,817 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3162 transitions. Word has length 25 [2020-02-10 20:41:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:06,817 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3162 transitions. [2020-02-10 20:41:06,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3162 transitions. [2020-02-10 20:41:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:06,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:06,818 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:06,818 INFO L427 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-02-10 20:41:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:06,819 INFO L82 PathProgramCache]: Analyzing trace with hash -663319889, now seen corresponding path program 54 times [2020-02-10 20:41:06,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:06,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662344771] [2020-02-10 20:41:06,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:07,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662344771] [2020-02-10 20:41:07,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:07,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:07,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297175629] [2020-02-10 20:41:07,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:07,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:07,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:07,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:07,235 INFO L87 Difference]: Start difference. First operand 793 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:41:07,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:07,408 INFO L93 Difference]: Finished difference Result 1396 states and 4912 transitions. [2020-02-10 20:41:07,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:07,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:07,413 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 20:41:07,413 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 20:41:07,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 20:41:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 783. [2020-02-10 20:41:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:41:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3140 transitions. [2020-02-10 20:41:07,439 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3140 transitions. Word has length 25 [2020-02-10 20:41:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:07,439 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3140 transitions. [2020-02-10 20:41:07,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3140 transitions. [2020-02-10 20:41:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:07,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:07,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-02-10 20:41:07,441 INFO L427 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-02-10 20:41:07,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:07,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1647193259, now seen corresponding path program 55 times [2020-02-10 20:41:07,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:07,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692013459] [2020-02-10 20:41:07,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:07,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692013459] [2020-02-10 20:41:07,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:07,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:07,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291739787] [2020-02-10 20:41:07,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:07,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:07,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:07,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:07,854 INFO L87 Difference]: Start difference. First operand 783 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:41:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:08,028 INFO L93 Difference]: Finished difference Result 1385 states and 4897 transitions. [2020-02-10 20:41:08,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:08,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:08,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:08,032 INFO L225 Difference]: With dead ends: 1385 [2020-02-10 20:41:08,033 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 20:41:08,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:08,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 20:41:08,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-02-10 20:41:08,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:41:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3162 transitions. [2020-02-10 20:41:08,057 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3162 transitions. Word has length 25 [2020-02-10 20:41:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:08,057 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3162 transitions. [2020-02-10 20:41:08,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3162 transitions. [2020-02-10 20:41:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:08,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:08,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-02-10 20:41:08,058 INFO L427 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-02-10 20:41:08,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:08,059 INFO L82 PathProgramCache]: Analyzing trace with hash -676941645, now seen corresponding path program 56 times [2020-02-10 20:41:08,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:08,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058792937] [2020-02-10 20:41:08,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:08,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058792937] [2020-02-10 20:41:08,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:08,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:08,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347259755] [2020-02-10 20:41:08,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:08,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:08,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:08,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:08,478 INFO L87 Difference]: Start difference. First operand 791 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:41:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:08,633 INFO L93 Difference]: Finished difference Result 1387 states and 4897 transitions. [2020-02-10 20:41:08,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:08,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:08,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:08,637 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:41:08,637 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:41:08,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:08,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:41:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-02-10 20:41:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:41:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3151 transitions. [2020-02-10 20:41:08,663 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3151 transitions. Word has length 25 [2020-02-10 20:41:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:08,663 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3151 transitions. [2020-02-10 20:41:08,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:08,663 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3151 transitions. [2020-02-10 20:41:08,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:08,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:08,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:08,665 INFO L427 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-02-10 20:41:08,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:08,665 INFO L82 PathProgramCache]: Analyzing trace with hash -164058321, now seen corresponding path program 57 times [2020-02-10 20:41:08,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:08,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503977777] [2020-02-10 20:41:08,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41: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-02-10 20:41:09,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503977777] [2020-02-10 20:41:09,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:09,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:09,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157683011] [2020-02-10 20:41:09,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:09,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:09,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:09,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:09,120 INFO L87 Difference]: Start difference. First operand 787 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:41:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:09,295 INFO L93 Difference]: Finished difference Result 1384 states and 4891 transitions. [2020-02-10 20:41:09,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:09,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:09,299 INFO L225 Difference]: With dead ends: 1384 [2020-02-10 20:41:09,299 INFO L226 Difference]: Without dead ends: 1371 [2020-02-10 20:41:09,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-02-10 20:41:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 791. [2020-02-10 20:41:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:41:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-02-10 20:41:09,324 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-02-10 20:41:09,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:09,324 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-02-10 20:41:09,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-02-10 20:41:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:09,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:09,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-02-10 20:41:09,328 INFO L427 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-02-10 20:41:09,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:09,328 INFO L82 PathProgramCache]: Analyzing trace with hash 837702605, now seen corresponding path program 58 times [2020-02-10 20:41:09,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:09,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344583431] [2020-02-10 20:41:09,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:09,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344583431] [2020-02-10 20:41:09,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:09,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:09,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947838382] [2020-02-10 20:41:09,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:09,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:09,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:09,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:09,730 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:41:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:09,884 INFO L93 Difference]: Finished difference Result 1385 states and 4889 transitions. [2020-02-10 20:41:09,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:09,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:09,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:09,889 INFO L225 Difference]: With dead ends: 1385 [2020-02-10 20:41:09,889 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 20:41:09,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 20:41:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 787. [2020-02-10 20:41:09,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:41:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-02-10 20:41:09,917 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-02-10 20:41:09,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:09,917 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-02-10 20:41:09,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-02-10 20:41:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:09,918 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:09,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-02-10 20:41:09,919 INFO L427 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-02-10 20:41:09,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:09,919 INFO L82 PathProgramCache]: Analyzing trace with hash 312875989, now seen corresponding path program 59 times [2020-02-10 20:41:09,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:09,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889161884] [2020-02-10 20:41:09,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:10,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889161884] [2020-02-10 20:41:10,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:10,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:10,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864656640] [2020-02-10 20:41:10,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:10,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:10,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:10,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:10,348 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:41:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:10,543 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-02-10 20:41:10,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:10,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:10,546 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 20:41:10,547 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 20:41:10,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 20:41:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 792. [2020-02-10 20:41:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:41:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3156 transitions. [2020-02-10 20:41:10,571 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3156 transitions. Word has length 25 [2020-02-10 20:41:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:10,571 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3156 transitions. [2020-02-10 20:41:10,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3156 transitions. [2020-02-10 20:41:10,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:10,572 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:10,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-02-10 20:41:10,572 INFO L427 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-02-10 20:41:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash 850731567, now seen corresponding path program 60 times [2020-02-10 20:41:10,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:10,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891603986] [2020-02-10 20:41:10,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:10,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891603986] [2020-02-10 20:41:10,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:10,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:10,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021416208] [2020-02-10 20:41:10,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:10,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:10,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:10,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:10,984 INFO L87 Difference]: Start difference. First operand 792 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:41:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:11,131 INFO L93 Difference]: Finished difference Result 1388 states and 4891 transitions. [2020-02-10 20:41:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:11,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:11,135 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 20:41:11,135 INFO L226 Difference]: Without dead ends: 1365 [2020-02-10 20:41:11,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2020-02-10 20:41:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 783. [2020-02-10 20:41:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:41:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3136 transitions. [2020-02-10 20:41:11,159 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3136 transitions. Word has length 25 [2020-02-10 20:41:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:11,160 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3136 transitions. [2020-02-10 20:41:11,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3136 transitions. [2020-02-10 20:41:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:11,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:11,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-02-10 20:41:11,161 INFO L427 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-02-10 20:41:11,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:11,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1359903445, now seen corresponding path program 61 times [2020-02-10 20:41:11,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:11,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749026257] [2020-02-10 20:41:11,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41: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-02-10 20:41:11,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749026257] [2020-02-10 20:41:11,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:11,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:11,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330013677] [2020-02-10 20:41:11,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:11,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:11,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:11,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:11,576 INFO L87 Difference]: Start difference. First operand 783 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:41:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:11,749 INFO L93 Difference]: Finished difference Result 1387 states and 4897 transitions. [2020-02-10 20:41:11,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:11,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:11,753 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:41:11,754 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 20:41:11,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:11,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 20:41:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 791. [2020-02-10 20:41:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:41:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-02-10 20:41:11,780 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-02-10 20:41:11,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:11,781 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-02-10 20:41:11,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-02-10 20:41:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:11,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:11,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-02-10 20:41:11,782 INFO L427 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-02-10 20:41:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:11,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1943806029, now seen corresponding path program 62 times [2020-02-10 20:41:11,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:11,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786266436] [2020-02-10 20:41:11,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:12,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786266436] [2020-02-10 20:41:12,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:12,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:12,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731617492] [2020-02-10 20:41:12,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:12,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:12,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:12,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:12,181 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:41:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:12,340 INFO L93 Difference]: Finished difference Result 1390 states and 4899 transitions. [2020-02-10 20:41:12,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:12,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:12,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:12,344 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:41:12,344 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 20:41:12,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 20:41:12,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-02-10 20:41:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:41:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-02-10 20:41:12,368 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-02-10 20:41:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:12,368 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-02-10 20:41:12,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-02-10 20:41:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:12,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:12,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-02-10 20:41:12,370 INFO L427 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-02-10 20:41:12,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:12,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1009029773, now seen corresponding path program 63 times [2020-02-10 20:41:12,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:12,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587494523] [2020-02-10 20:41:12,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:12,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587494523] [2020-02-10 20:41:12,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:12,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:12,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195783964] [2020-02-10 20:41:12,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:12,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:12,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:12,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:12,773 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:41:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:12,932 INFO L93 Difference]: Finished difference Result 1385 states and 4889 transitions. [2020-02-10 20:41:12,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:12,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:12,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:12,936 INFO L225 Difference]: With dead ends: 1385 [2020-02-10 20:41:12,936 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 20:41:12,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-02-10 20:41:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 20:41:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-02-10 20:41:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:41:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3154 transitions. [2020-02-10 20:41:12,961 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3154 transitions. Word has length 25 [2020-02-10 20:41:12,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:12,961 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3154 transitions. [2020-02-10 20:41:12,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3154 transitions. [2020-02-10 20:41:12,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:12,962 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:12,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-02-10 20:41:12,962 INFO L427 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-02-10 20:41:12,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:12,963 INFO L82 PathProgramCache]: Analyzing trace with hash -7268847, now seen corresponding path program 64 times [2020-02-10 20:41:12,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:12,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162644495] [2020-02-10 20:41:12,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:13,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162644495] [2020-02-10 20:41:13,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:13,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:13,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269583987] [2020-02-10 20:41:13,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:13,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:13,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:13,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:13,409 INFO L87 Difference]: Start difference. First operand 791 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:41:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:13,555 INFO L93 Difference]: Finished difference Result 1386 states and 4887 transitions. [2020-02-10 20:41:13,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:13,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:13,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:13,559 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 20:41:13,559 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:41:13,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-02-10 20:41:13,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:41:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-02-10 20:41:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:41:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3143 transitions. [2020-02-10 20:41:13,584 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3143 transitions. Word has length 25 [2020-02-10 20:41:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:13,584 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3143 transitions. [2020-02-10 20:41:13,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3143 transitions. [2020-02-10 20:41:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:13,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:13,585 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:13,585 INFO L427 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-02-10 20:41:13,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:13,586 INFO L82 PathProgramCache]: Analyzing trace with hash -953988395, now seen corresponding path program 65 times [2020-02-10 20:41:13,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:13,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251102186] [2020-02-10 20:41:13,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:13,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251102186] [2020-02-10 20:41:13,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:13,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:13,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673824992] [2020-02-10 20:41:13,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:13,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:13,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:13,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:13,980 INFO L87 Difference]: Start difference. First operand 787 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:41:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:14,148 INFO L93 Difference]: Finished difference Result 1392 states and 4900 transitions. [2020-02-10 20:41:14,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:14,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:14,152 INFO L225 Difference]: With dead ends: 1392 [2020-02-10 20:41:14,152 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:41:14,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:14,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:41:14,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 792. [2020-02-10 20:41:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:41:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3152 transitions. [2020-02-10 20:41:14,176 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3152 transitions. Word has length 25 [2020-02-10 20:41:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:14,177 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3152 transitions. [2020-02-10 20:41:14,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3152 transitions. [2020-02-10 20:41:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:14,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:14,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-02-10 20:41:14,178 INFO L427 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-02-10 20:41:14,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:14,178 INFO L82 PathProgramCache]: Analyzing trace with hash 656952563, now seen corresponding path program 66 times [2020-02-10 20:41:14,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:14,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637839510] [2020-02-10 20:41:14,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:14,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637839510] [2020-02-10 20:41:14,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:14,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:14,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663134783] [2020-02-10 20:41:14,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:14,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:14,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:14,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:14,602 INFO L87 Difference]: Start difference. First operand 792 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:41:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:14,773 INFO L93 Difference]: Finished difference Result 1390 states and 4891 transitions. [2020-02-10 20:41:14,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:14,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:14,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:14,777 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:41:14,778 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 20:41:14,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 20:41:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 783. [2020-02-10 20:41:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:41:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3132 transitions. [2020-02-10 20:41:14,802 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3132 transitions. Word has length 25 [2020-02-10 20:41:14,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:14,802 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3132 transitions. [2020-02-10 20:41:14,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3132 transitions. [2020-02-10 20:41:14,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:14,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:14,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:14,804 INFO L427 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-02-10 20:41:14,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:14,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1029341073, now seen corresponding path program 67 times [2020-02-10 20:41:14,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:14,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968743965] [2020-02-10 20:41:14,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:15,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968743965] [2020-02-10 20:41:15,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:15,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:15,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446373675] [2020-02-10 20:41:15,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:15,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:15,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:15,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:15,219 INFO L87 Difference]: Start difference. First operand 783 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:41:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:15,357 INFO L93 Difference]: Finished difference Result 1399 states and 4924 transitions. [2020-02-10 20:41:15,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:15,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:15,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:15,361 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 20:41:15,362 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 20:41:15,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-02-10 20:41:15,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 20:41:15,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 794. [2020-02-10 20:41:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:41:15,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-02-10 20:41:15,386 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-02-10 20:41:15,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:15,386 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-02-10 20:41:15,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:15,386 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-02-10 20:41:15,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:15,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:15,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-02-10 20:41:15,388 INFO L427 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-02-10 20:41:15,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:15,388 INFO L82 PathProgramCache]: Analyzing trace with hash -43744307, now seen corresponding path program 68 times [2020-02-10 20:41:15,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:15,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769150717] [2020-02-10 20:41:15,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:15,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769150717] [2020-02-10 20:41:15,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:15,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:15,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204865388] [2020-02-10 20:41:15,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:15,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:15,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:15,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:15,801 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:41:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:15,940 INFO L93 Difference]: Finished difference Result 1400 states and 4920 transitions. [2020-02-10 20:41:15,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:15,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:15,944 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 20:41:15,944 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 20:41:15,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-02-10 20:41:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 20:41:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 788. [2020-02-10 20:41:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 20:41:15,969 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 20:41:15,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:15,969 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 20:41:15,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 20:41:15,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:15,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:15,971 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:15,971 INFO L427 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-02-10 20:41:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:15,971 INFO L82 PathProgramCache]: Analyzing trace with hash -571096781, now seen corresponding path program 69 times [2020-02-10 20:41:15,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:15,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887851690] [2020-02-10 20:41:15,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:16,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887851690] [2020-02-10 20:41:16,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:16,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:16,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953360383] [2020-02-10 20:41:16,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:16,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:16,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:16,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:16,408 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:41:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:16,555 INFO L93 Difference]: Finished difference Result 1396 states and 4912 transitions. [2020-02-10 20:41:16,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:16,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:16,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:16,558 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 20:41:16,559 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 20:41:16,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-02-10 20:41:16,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 20:41:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 793. [2020-02-10 20:41:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:41:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3155 transitions. [2020-02-10 20:41:16,583 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3155 transitions. Word has length 25 [2020-02-10 20:41:16,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:16,583 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3155 transitions. [2020-02-10 20:41:16,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3155 transitions. [2020-02-10 20:41:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:16,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:16,585 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:16,585 INFO L427 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-02-10 20:41:16,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:16,585 INFO L82 PathProgramCache]: Analyzing trace with hash -33241203, now seen corresponding path program 70 times [2020-02-10 20:41:16,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:16,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016941062] [2020-02-10 20:41:16,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:17,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016941062] [2020-02-10 20:41:17,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:17,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:17,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486389438] [2020-02-10 20:41:17,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:17,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:17,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:17,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:17,002 INFO L87 Difference]: Start difference. First operand 793 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:41:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:17,153 INFO L93 Difference]: Finished difference Result 1395 states and 4905 transitions. [2020-02-10 20:41:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:17,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:17,157 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:41:17,157 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:41:17,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:41:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 788. [2020-02-10 20:41:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3141 transitions. [2020-02-10 20:41:17,182 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3141 transitions. Word has length 25 [2020-02-10 20:41:17,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:17,183 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3141 transitions. [2020-02-10 20:41:17,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3141 transitions. [2020-02-10 20:41:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:17,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:17,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-02-10 20:41:17,184 INFO L427 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-02-10 20:41:17,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:17,184 INFO L82 PathProgramCache]: Analyzing trace with hash -550090573, now seen corresponding path program 71 times [2020-02-10 20:41:17,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:17,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276499521] [2020-02-10 20:41:17,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:17,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276499521] [2020-02-10 20:41:17,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:17,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:17,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967312852] [2020-02-10 20:41:17,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:17,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:17,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:17,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:17,621 INFO L87 Difference]: Start difference. First operand 788 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:41:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:17,790 INFO L93 Difference]: Finished difference Result 1398 states and 4911 transitions. [2020-02-10 20:41:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:17,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:17,793 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 20:41:17,793 INFO L226 Difference]: Without dead ends: 1382 [2020-02-10 20:41:17,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-02-10 20:41:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 793. [2020-02-10 20:41:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:41:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3150 transitions. [2020-02-10 20:41:17,821 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3150 transitions. Word has length 25 [2020-02-10 20:41:17,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:17,821 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3150 transitions. [2020-02-10 20:41:17,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3150 transitions. [2020-02-10 20:41:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:17,822 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:17,822 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:17,823 INFO L427 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-02-10 20:41:17,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:17,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1060850385, now seen corresponding path program 72 times [2020-02-10 20:41:17,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:17,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861489347] [2020-02-10 20:41:17,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:18,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861489347] [2020-02-10 20:41:18,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:18,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:18,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264751971] [2020-02-10 20:41:18,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:18,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:18,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:18,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:18,235 INFO L87 Difference]: Start difference. First operand 793 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:41:18,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:18,377 INFO L93 Difference]: Finished difference Result 1396 states and 4902 transitions. [2020-02-10 20:41:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:18,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:18,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:18,380 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 20:41:18,381 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:41:18,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:18,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:41:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 779. [2020-02-10 20:41:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:41:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3122 transitions. [2020-02-10 20:41:18,407 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3122 transitions. Word has length 25 [2020-02-10 20:41:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:18,408 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3122 transitions. [2020-02-10 20:41:18,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3122 transitions. [2020-02-10 20:41:18,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:18,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:18,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-02-10 20:41:18,409 INFO L427 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-02-10 20:41:18,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:18,409 INFO L82 PathProgramCache]: Analyzing trace with hash 66685201, now seen corresponding path program 73 times [2020-02-10 20:41:18,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:18,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323701890] [2020-02-10 20:41:18,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:18,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323701890] [2020-02-10 20:41:18,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:18,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:18,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715182104] [2020-02-10 20:41:18,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:18,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:18,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:18,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:18,837 INFO L87 Difference]: Start difference. First operand 779 states and 3122 transitions. Second operand 10 states. [2020-02-10 20:41:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:18,981 INFO L93 Difference]: Finished difference Result 1362 states and 4829 transitions. [2020-02-10 20:41:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:18,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:18,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:18,985 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 20:41:18,986 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 20:41:18,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-02-10 20:41:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 20:41:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 788. [2020-02-10 20:41:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-02-10 20:41:19,010 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-02-10 20:41:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:19,010 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-02-10 20:41:19,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-02-10 20:41:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:19,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:19,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-02-10 20:41:19,011 INFO L427 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-02-10 20:41:19,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:19,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1047439919, now seen corresponding path program 74 times [2020-02-10 20:41:19,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:19,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696341110] [2020-02-10 20:41:19,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:19,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696341110] [2020-02-10 20:41:19,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:19,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:19,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046082195] [2020-02-10 20:41:19,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:19,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:19,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:19,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:19,411 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:41:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:19,584 INFO L93 Difference]: Finished difference Result 1361 states and 4824 transitions. [2020-02-10 20:41:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:19,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:19,588 INFO L225 Difference]: With dead ends: 1361 [2020-02-10 20:41:19,588 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 20:41:19,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 20:41:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 785. [2020-02-10 20:41:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-02-10 20:41:19,612 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-02-10 20:41:19,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:19,612 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-02-10 20:41:19,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-02-10 20:41:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:19,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:19,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-02-10 20:41:19,614 INFO L427 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-02-10 20:41:19,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:19,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1992719279, now seen corresponding path program 75 times [2020-02-10 20:41:19,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:19,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135540669] [2020-02-10 20:41:19,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:20,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135540669] [2020-02-10 20:41:20,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:20,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:20,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704890480] [2020-02-10 20:41:20,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:20,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:20,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:20,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:20,038 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:41:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:20,171 INFO L93 Difference]: Finished difference Result 1367 states and 4837 transitions. [2020-02-10 20:41:20,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:20,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:20,176 INFO L225 Difference]: With dead ends: 1367 [2020-02-10 20:41:20,176 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 20:41:20,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-02-10 20:41:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 20:41:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 789. [2020-02-10 20:41:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:41:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-02-10 20:41:20,200 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-02-10 20:41:20,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:20,201 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-02-10 20:41:20,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-02-10 20:41:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:20,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:20,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-02-10 20:41:20,202 INFO L427 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-02-10 20:41:20,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:20,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1310990195, now seen corresponding path program 76 times [2020-02-10 20:41:20,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:20,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342982502] [2020-02-10 20:41:20,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:20,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342982502] [2020-02-10 20:41:20,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:20,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:20,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449345670] [2020-02-10 20:41:20,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:20,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:20,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:20,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:20,599 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:41:20,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:20,762 INFO L93 Difference]: Finished difference Result 1370 states and 4839 transitions. [2020-02-10 20:41:20,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:20,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:20,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:20,766 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:41:20,766 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:41:20,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:20,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:41:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-02-10 20:41:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 20:41:20,791 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 20:41:20,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:20,791 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 20:41:20,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 20:41:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:20,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:20,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:20,793 INFO L427 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-02-10 20:41:20,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:20,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1711661329, now seen corresponding path program 77 times [2020-02-10 20:41:20,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:20,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977518138] [2020-02-10 20:41:20,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:21,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977518138] [2020-02-10 20:41:21,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:21,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:21,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427992966] [2020-02-10 20:41:21,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:21,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:21,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:21,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:21,185 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:41:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:21,319 INFO L93 Difference]: Finished difference Result 1364 states and 4827 transitions. [2020-02-10 20:41:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:21,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:21,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:21,323 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:41:21,323 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 20:41:21,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 20:41:21,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-02-10 20:41:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 20:41:21,349 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 20:41:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:21,350 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 20:41:21,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 20:41:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:21,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:21,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-02-10 20:41:21,351 INFO L427 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-02-10 20:41:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:21,352 INFO L82 PathProgramCache]: Analyzing trace with hash -972365009, now seen corresponding path program 78 times [2020-02-10 20:41:21,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:21,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895488903] [2020-02-10 20:41:21,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:21,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895488903] [2020-02-10 20:41:21,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:21,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:21,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180714902] [2020-02-10 20:41:21,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:21,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:21,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:21,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:21,748 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:41:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:21,910 INFO L93 Difference]: Finished difference Result 1368 states and 4832 transitions. [2020-02-10 20:41:21,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:21,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:21,914 INFO L225 Difference]: With dead ends: 1368 [2020-02-10 20:41:21,915 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 20:41:21,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 20:41:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 782. [2020-02-10 20:41:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:41:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-02-10 20:41:21,940 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-02-10 20:41:21,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:21,941 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-02-10 20:41:21,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-02-10 20:41:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:21,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:21,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:21,943 INFO L427 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-02-10 20:41:21,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:21,943 INFO L82 PathProgramCache]: Analyzing trace with hash -355800525, now seen corresponding path program 79 times [2020-02-10 20:41:21,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:21,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146103647] [2020-02-10 20:41:21,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:22,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146103647] [2020-02-10 20:41:22,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:22,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:22,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545564631] [2020-02-10 20:41:22,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:22,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:22,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:22,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:22,377 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:41:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:22,537 INFO L93 Difference]: Finished difference Result 1360 states and 4822 transitions. [2020-02-10 20:41:22,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:22,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:22,542 INFO L225 Difference]: With dead ends: 1360 [2020-02-10 20:41:22,542 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 20:41:22,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 20:41:22,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-02-10 20:41:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-02-10 20:41:22,567 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-02-10 20:41:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:22,567 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-02-10 20:41:22,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-02-10 20:41:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:22,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:22,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:22,570 INFO L427 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-02-10 20:41:22,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:22,570 INFO L82 PathProgramCache]: Analyzing trace with hash 624954193, now seen corresponding path program 80 times [2020-02-10 20:41:22,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:22,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039660402] [2020-02-10 20:41:22,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:22,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039660402] [2020-02-10 20:41:22,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:22,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:22,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753873632] [2020-02-10 20:41:22,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:22,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:22,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:22,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:22,996 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:41:23,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:23,142 INFO L93 Difference]: Finished difference Result 1359 states and 4817 transitions. [2020-02-10 20:41:23,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:23,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:23,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:23,145 INFO L225 Difference]: With dead ends: 1359 [2020-02-10 20:41:23,145 INFO L226 Difference]: Without dead ends: 1344 [2020-02-10 20:41:23,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2020-02-10 20:41:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 785. [2020-02-10 20:41:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 20:41:23,177 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 20:41:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:23,178 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 20:41:23,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 20:41:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:23,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:23,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-02-10 20:41:23,181 INFO L427 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-02-10 20:41:23,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:23,181 INFO L82 PathProgramCache]: Analyzing trace with hash -798699665, now seen corresponding path program 81 times [2020-02-10 20:41:23,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:23,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514810476] [2020-02-10 20:41:23,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:23,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514810476] [2020-02-10 20:41:23,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:23,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:23,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968843500] [2020-02-10 20:41:23,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:23,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:23,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:23,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:23,607 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:41:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:23,754 INFO L93 Difference]: Finished difference Result 1363 states and 4826 transitions. [2020-02-10 20:41:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:23,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:23,758 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 20:41:23,758 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:41:23,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:23,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:41:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 789. [2020-02-10 20:41:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:41:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-02-10 20:41:23,784 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-02-10 20:41:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:23,785 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-02-10 20:41:23,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-02-10 20:41:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:23,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:23,786 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:23,787 INFO L427 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-02-10 20:41:23,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:23,787 INFO L82 PathProgramCache]: Analyzing trace with hash 203061261, now seen corresponding path program 82 times [2020-02-10 20:41:23,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:23,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432457999] [2020-02-10 20:41:23,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:24,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432457999] [2020-02-10 20:41:24,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:24,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:24,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893438164] [2020-02-10 20:41:24,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:24,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:24,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:24,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:24,199 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:41:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:24,338 INFO L93 Difference]: Finished difference Result 1364 states and 4824 transitions. [2020-02-10 20:41:24,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:24,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:24,341 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:41:24,341 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 20:41:24,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-02-10 20:41:24,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 20:41:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 785. [2020-02-10 20:41:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-02-10 20:41:24,365 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-02-10 20:41:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:24,365 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-02-10 20:41:24,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-02-10 20:41:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:24,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:24,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-02-10 20:41:24,367 INFO L427 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-02-10 20:41:24,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:24,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1614771827, now seen corresponding path program 83 times [2020-02-10 20:41:24,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:24,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240596486] [2020-02-10 20:41:24,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:24,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240596486] [2020-02-10 20:41:24,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:24,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:24,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204738692] [2020-02-10 20:41:24,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:24,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:24,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:24,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:24,772 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:41:24,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:24,919 INFO L93 Difference]: Finished difference Result 1360 states and 4816 transitions. [2020-02-10 20:41:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:24,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:24,928 INFO L225 Difference]: With dead ends: 1360 [2020-02-10 20:41:24,928 INFO L226 Difference]: Without dead ends: 1348 [2020-02-10 20:41:24,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-02-10 20:41:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 788. [2020-02-10 20:41:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-02-10 20:41:24,963 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-02-10 20:41:24,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:24,963 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-02-10 20:41:24,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-02-10 20:41:24,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:24,964 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:24,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-02-10 20:41:24,965 INFO L427 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-02-10 20:41:24,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:24,965 INFO L82 PathProgramCache]: Analyzing trace with hash 541686447, now seen corresponding path program 84 times [2020-02-10 20:41:24,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:24,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444463195] [2020-02-10 20:41:24,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:25,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-02-10 20:41:25,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444463195] [2020-02-10 20:41:25,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:25,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:25,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648830504] [2020-02-10 20:41:25,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:25,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:25,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:25,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:25,373 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:41:25,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:25,532 INFO L93 Difference]: Finished difference Result 1362 states and 4817 transitions. [2020-02-10 20:41:25,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:25,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:25,536 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 20:41:25,536 INFO L226 Difference]: Without dead ends: 1342 [2020-02-10 20:41:25,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-02-10 20:41:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2020-02-10 20:41:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 782. [2020-02-10 20:41:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:41:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3130 transitions. [2020-02-10 20:41:25,561 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3130 transitions. Word has length 25 [2020-02-10 20:41:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:25,561 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3130 transitions. [2020-02-10 20:41:25,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3130 transitions. [2020-02-10 20:41:25,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:25,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:25,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-02-10 20:41:25,562 INFO L427 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-02-10 20:41:25,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:25,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1147747827, now seen corresponding path program 85 times [2020-02-10 20:41:25,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:25,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109896992] [2020-02-10 20:41:25,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:25,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109896992] [2020-02-10 20:41:25,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:25,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:25,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465532128] [2020-02-10 20:41:25,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:25,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:25,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:25,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:25,970 INFO L87 Difference]: Start difference. First operand 782 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:41:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:26,107 INFO L93 Difference]: Finished difference Result 1373 states and 4851 transitions. [2020-02-10 20:41:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:26,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:26,111 INFO L225 Difference]: With dead ends: 1373 [2020-02-10 20:41:26,111 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 20:41:26,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 20:41:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 790. [2020-02-10 20:41:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:41:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3152 transitions. [2020-02-10 20:41:26,136 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3152 transitions. Word has length 25 [2020-02-10 20:41:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:26,136 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3152 transitions. [2020-02-10 20:41:26,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3152 transitions. [2020-02-10 20:41:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:26,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:26,138 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:26,138 INFO L427 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-02-10 20:41:26,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2139005649, now seen corresponding path program 86 times [2020-02-10 20:41:26,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:26,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633782974] [2020-02-10 20:41:26,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:26,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633782974] [2020-02-10 20:41:26,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:26,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:26,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915843641] [2020-02-10 20:41:26,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:26,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:26,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:26,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:26,540 INFO L87 Difference]: Start difference. First operand 790 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:41:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:26,690 INFO L93 Difference]: Finished difference Result 1376 states and 4853 transitions. [2020-02-10 20:41:26,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:26,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:26,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:26,694 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:41:26,694 INFO L226 Difference]: Without dead ends: 1356 [2020-02-10 20:41:26,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:26,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-02-10 20:41:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 786. [2020-02-10 20:41:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:41:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3141 transitions. [2020-02-10 20:41:26,717 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3141 transitions. Word has length 25 [2020-02-10 20:41:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:26,717 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3141 transitions. [2020-02-10 20:41:26,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3141 transitions. [2020-02-10 20:41:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:26,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:26,719 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:26,719 INFO L427 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-02-10 20:41:26,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:26,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1221185391, now seen corresponding path program 87 times [2020-02-10 20:41:26,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:26,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233815983] [2020-02-10 20:41:26,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:27,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233815983] [2020-02-10 20:41:27,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:27,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:27,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907156301] [2020-02-10 20:41:27,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:27,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:27,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:27,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:27,118 INFO L87 Difference]: Start difference. First operand 786 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:41:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:27,273 INFO L93 Difference]: Finished difference Result 1371 states and 4843 transitions. [2020-02-10 20:41:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:27,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:27,278 INFO L225 Difference]: With dead ends: 1371 [2020-02-10 20:41:27,278 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:41:27,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-02-10 20:41:27,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:41:27,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 790. [2020-02-10 20:41:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:41:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-02-10 20:41:27,302 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-02-10 20:41:27,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:27,303 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-02-10 20:41:27,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-02-10 20:41:27,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:27,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:27,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-02-10 20:41:27,304 INFO L427 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-02-10 20:41:27,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:27,305 INFO L82 PathProgramCache]: Analyzing trace with hash -219424465, now seen corresponding path program 88 times [2020-02-10 20:41:27,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:27,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160818280] [2020-02-10 20:41:27,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:27,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160818280] [2020-02-10 20:41:27,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:27,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:27,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835118586] [2020-02-10 20:41:27,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:27,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:27,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:27,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:27,703 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:41:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:27,872 INFO L93 Difference]: Finished difference Result 1372 states and 4841 transitions. [2020-02-10 20:41:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:27,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:27,876 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 20:41:27,876 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 20:41:27,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-02-10 20:41:27,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 20:41:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 786. [2020-02-10 20:41:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:41:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3137 transitions. [2020-02-10 20:41:27,900 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3137 transitions. Word has length 25 [2020-02-10 20:41:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:27,900 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3137 transitions. [2020-02-10 20:41:27,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3137 transitions. [2020-02-10 20:41:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:27,901 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:27,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-02-10 20:41:27,902 INFO L427 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-02-10 20:41:27,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:27,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1166144013, now seen corresponding path program 89 times [2020-02-10 20:41:27,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:27,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003037913] [2020-02-10 20:41:27,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:28,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:28,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003037913] [2020-02-10 20:41:28,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:28,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:28,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741082988] [2020-02-10 20:41:28,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:28,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:28,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:28,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:28,305 INFO L87 Difference]: Start difference. First operand 786 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:41:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:28,470 INFO L93 Difference]: Finished difference Result 1378 states and 4854 transitions. [2020-02-10 20:41:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:28,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:28,474 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 20:41:28,474 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 20:41:28,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 20:41:28,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 791. [2020-02-10 20:41:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:41:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-02-10 20:41:28,498 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-02-10 20:41:28,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:28,498 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-02-10 20:41:28,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:28,498 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-02-10 20:41:28,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:28,499 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:28,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:28,499 INFO L427 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-02-10 20:41:28,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:28,500 INFO L82 PathProgramCache]: Analyzing trace with hash 444796945, now seen corresponding path program 90 times [2020-02-10 20:41:28,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:28,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571630239] [2020-02-10 20:41:28,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:28,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-02-10 20:41:28,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571630239] [2020-02-10 20:41:28,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:28,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:28,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863768933] [2020-02-10 20:41:28,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:28,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:28,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:28,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:28,906 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:41:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:29,051 INFO L93 Difference]: Finished difference Result 1376 states and 4845 transitions. [2020-02-10 20:41:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:29,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:29,055 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:41:29,055 INFO L226 Difference]: Without dead ends: 1353 [2020-02-10 20:41:29,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-02-10 20:41:29,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2020-02-10 20:41:29,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 782. [2020-02-10 20:41:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:41:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-02-10 20:41:29,080 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-02-10 20:41:29,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:29,080 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-02-10 20:41:29,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-02-10 20:41:29,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:29,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:29,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-02-10 20:41:29,081 INFO L427 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-02-10 20:41:29,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:29,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1963730385, now seen corresponding path program 91 times [2020-02-10 20:41:29,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:29,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816542443] [2020-02-10 20:41:29,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:29,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816542443] [2020-02-10 20:41:29,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:29,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:29,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795110852] [2020-02-10 20:41:29,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:29,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:29,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:29,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:29,464 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:41:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:29,622 INFO L93 Difference]: Finished difference Result 1366 states and 4829 transitions. [2020-02-10 20:41:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:29,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:29,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:29,626 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 20:41:29,626 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 20:41:29,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-02-10 20:41:29,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 20:41:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 788. [2020-02-10 20:41:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:29,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-02-10 20:41:29,650 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-02-10 20:41:29,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:29,650 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-02-10 20:41:29,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:29,650 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-02-10 20:41:29,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:29,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:29,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-02-10 20:41:29,651 INFO L427 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-02-10 20:41:29,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:29,652 INFO L82 PathProgramCache]: Analyzing trace with hash -352789427, now seen corresponding path program 92 times [2020-02-10 20:41:29,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:29,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357955175] [2020-02-10 20:41:29,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:30,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357955175] [2020-02-10 20:41:30,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:30,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:30,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295351341] [2020-02-10 20:41:30,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:30,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:30,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:30,059 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:41:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:30,213 INFO L93 Difference]: Finished difference Result 1370 states and 4834 transitions. [2020-02-10 20:41:30,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:30,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:30,217 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:41:30,217 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 20:41:30,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:30,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 20:41:30,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 785. [2020-02-10 20:41:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-02-10 20:41:30,241 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-02-10 20:41:30,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:30,241 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-02-10 20:41:30,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:30,241 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-02-10 20:41:30,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:30,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41: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-02-10 20:41:30,243 INFO L427 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-02-10 20:41:30,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:30,243 INFO L82 PathProgramCache]: Analyzing trace with hash 730799057, now seen corresponding path program 93 times [2020-02-10 20:41:30,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:30,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593683769] [2020-02-10 20:41:30,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:30,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593683769] [2020-02-10 20:41:30,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:30,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:30,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347889524] [2020-02-10 20:41:30,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:30,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:30,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:30,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:30,651 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:41:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:30,821 INFO L93 Difference]: Finished difference Result 1364 states and 4822 transitions. [2020-02-10 20:41:30,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:30,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:30,825 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:41:30,826 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 20:41:30,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-02-10 20:41:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 20:41:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-02-10 20:41:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:30,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-02-10 20:41:30,850 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-02-10 20:41:30,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:30,850 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-02-10 20:41:30,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-02-10 20:41:30,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:30,851 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:30,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-02-10 20:41:30,852 INFO L427 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-02-10 20:41:30,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:30,852 INFO L82 PathProgramCache]: Analyzing trace with hash -342286323, now seen corresponding path program 94 times [2020-02-10 20:41:30,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:30,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178844972] [2020-02-10 20:41:30,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:31,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-02-10 20:41:31,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178844972] [2020-02-10 20:41:31,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:31,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:31,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417712974] [2020-02-10 20:41:31,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:31,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:31,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:31,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:31,248 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:41:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:31,399 INFO L93 Difference]: Finished difference Result 1366 states and 4823 transitions. [2020-02-10 20:41:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:31,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:31,403 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 20:41:31,403 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 20:41:31,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 20:41:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 785. [2020-02-10 20:41:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3132 transitions. [2020-02-10 20:41:31,428 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3132 transitions. Word has length 25 [2020-02-10 20:41:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:31,428 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3132 transitions. [2020-02-10 20:41:31,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3132 transitions. [2020-02-10 20:41:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:31,430 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:31,430 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:31,430 INFO L427 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-02-10 20:41:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:31,430 INFO L82 PathProgramCache]: Analyzing trace with hash 741302161, now seen corresponding path program 95 times [2020-02-10 20:41:31,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:31,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667962025] [2020-02-10 20:41:31,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:31,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667962025] [2020-02-10 20:41:31,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:31,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:31,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746185475] [2020-02-10 20:41:31,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:31,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:31,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:31,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:31,829 INFO L87 Difference]: Start difference. First operand 785 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:41:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:32,024 INFO L93 Difference]: Finished difference Result 1374 states and 4841 transitions. [2020-02-10 20:41:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:32,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:32,028 INFO L225 Difference]: With dead ends: 1374 [2020-02-10 20:41:32,028 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:41:32,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-02-10 20:41:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:41:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 790. [2020-02-10 20:41:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:41:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3141 transitions. [2020-02-10 20:41:32,053 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3141 transitions. Word has length 25 [2020-02-10 20:41:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:32,053 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3141 transitions. [2020-02-10 20:41:32,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3141 transitions. [2020-02-10 20:41:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:32,055 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:32,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-02-10 20:41:32,055 INFO L427 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-02-10 20:41:32,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:32,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1942724177, now seen corresponding path program 96 times [2020-02-10 20:41:32,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:32,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848493805] [2020-02-10 20:41:32,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:32,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848493805] [2020-02-10 20:41:32,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:32,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:32,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669045340] [2020-02-10 20:41:32,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:32,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:32,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:32,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:32,451 INFO L87 Difference]: Start difference. First operand 790 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:41:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:32,616 INFO L93 Difference]: Finished difference Result 1372 states and 4832 transitions. [2020-02-10 20:41:32,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:32,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:32,620 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 20:41:32,621 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 20:41:32,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-02-10 20:41:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 20:41:32,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 779. [2020-02-10 20:41:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:41:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3119 transitions. [2020-02-10 20:41:32,645 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3119 transitions. Word has length 25 [2020-02-10 20:41:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:32,645 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3119 transitions. [2020-02-10 20:41:32,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3119 transitions. [2020-02-10 20:41:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:32,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:32,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-02-10 20:41:32,646 INFO L427 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-02-10 20:41:32,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:32,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2073967317, now seen corresponding path program 97 times [2020-02-10 20:41:32,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:32,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588068013] [2020-02-10 20:41:32,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:33,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588068013] [2020-02-10 20:41:33,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:33,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:33,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067690435] [2020-02-10 20:41:33,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:33,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:33,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:33,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:33,041 INFO L87 Difference]: Start difference. First operand 779 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:41:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:33,207 INFO L93 Difference]: Finished difference Result 1376 states and 4861 transitions. [2020-02-10 20:41:33,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:33,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:33,210 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:41:33,210 INFO L226 Difference]: Without dead ends: 1361 [2020-02-10 20:41:33,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2020-02-10 20:41:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 788. [2020-02-10 20:41:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-02-10 20:41:33,234 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-02-10 20:41:33,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:33,235 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-02-10 20:41:33,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:33,235 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-02-10 20:41:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:33,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:33,236 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:33,236 INFO L427 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-02-10 20:41:33,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:33,236 INFO L82 PathProgramCache]: Analyzing trace with hash -610059021, now seen corresponding path program 98 times [2020-02-10 20:41:33,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:33,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43510253] [2020-02-10 20:41:33,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:33,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43510253] [2020-02-10 20:41:33,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:33,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:33,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260031266] [2020-02-10 20:41:33,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:33,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:33,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:33,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:33,634 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:41:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:33,774 INFO L93 Difference]: Finished difference Result 1373 states and 4852 transitions. [2020-02-10 20:41:33,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:33,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:33,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:33,779 INFO L225 Difference]: With dead ends: 1373 [2020-02-10 20:41:33,779 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:41:33,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:41:33,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 785. [2020-02-10 20:41:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 20:41:33,803 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 20:41:33,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:33,803 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 20:41:33,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 20:41:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:33,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:33,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-02-10 20:41:33,805 INFO L427 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-02-10 20:41:33,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:33,805 INFO L82 PathProgramCache]: Analyzing trace with hash 473529463, now seen corresponding path program 99 times [2020-02-10 20:41:33,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:33,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287594597] [2020-02-10 20:41:33,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:34,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287594597] [2020-02-10 20:41:34,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:34,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:34,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863096417] [2020-02-10 20:41:34,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:34,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:34,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:34,209 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:41:34,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:34,356 INFO L93 Difference]: Finished difference Result 1383 states and 4875 transitions. [2020-02-10 20:41:34,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:34,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:34,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:34,361 INFO L225 Difference]: With dead ends: 1383 [2020-02-10 20:41:34,361 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:41:34,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-02-10 20:41:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:41:34,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 791. [2020-02-10 20:41:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:41:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3152 transitions. [2020-02-10 20:41:34,385 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3152 transitions. Word has length 25 [2020-02-10 20:41:34,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:34,385 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3152 transitions. [2020-02-10 20:41:34,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3152 transitions. [2020-02-10 20:41:34,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:34,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:34,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-02-10 20:41:34,387 INFO L427 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-02-10 20:41:34,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:34,387 INFO L82 PathProgramCache]: Analyzing trace with hash -599555917, now seen corresponding path program 100 times [2020-02-10 20:41:34,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:34,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147943710] [2020-02-10 20:41:34,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:34,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147943710] [2020-02-10 20:41:34,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:34,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:34,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054671220] [2020-02-10 20:41:34,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:34,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:34,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:34,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:34,803 INFO L87 Difference]: Start difference. First operand 791 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:41:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:34,968 INFO L93 Difference]: Finished difference Result 1384 states and 4871 transitions. [2020-02-10 20:41:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:34,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:34,972 INFO L225 Difference]: With dead ends: 1384 [2020-02-10 20:41:34,972 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 20:41:34,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 20:41:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 785. [2020-02-10 20:41:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-02-10 20:41:34,996 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-02-10 20:41:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:34,996 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-02-10 20:41:34,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:34,997 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-02-10 20:41:34,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:34,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:34,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:34,999 INFO L427 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-02-10 20:41:34,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:34,999 INFO L82 PathProgramCache]: Analyzing trace with hash 484032567, now seen corresponding path program 101 times [2020-02-10 20:41:34,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:34,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247949819] [2020-02-10 20:41:34,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:35,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247949819] [2020-02-10 20:41:35,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:35,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:35,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227866437] [2020-02-10 20:41:35,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:35,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:35,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:35,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:35,405 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:41:35,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:35,542 INFO L93 Difference]: Finished difference Result 1374 states and 4851 transitions. [2020-02-10 20:41:35,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:35,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:35,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:35,546 INFO L225 Difference]: With dead ends: 1374 [2020-02-10 20:41:35,547 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 20:41:35,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 20:41:35,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 788. [2020-02-10 20:41:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-02-10 20:41:35,572 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-02-10 20:41:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:35,572 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-02-10 20:41:35,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-02-10 20:41:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:35,573 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:35,573 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:35,573 INFO L427 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-02-10 20:41:35,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:35,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2094973525, now seen corresponding path program 102 times [2020-02-10 20:41:35,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:35,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463381700] [2020-02-10 20:41:35,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:35,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463381700] [2020-02-10 20:41:35,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:35,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:35,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978814061] [2020-02-10 20:41:35,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:35,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:35,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:35,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:35,970 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:41:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:36,109 INFO L93 Difference]: Finished difference Result 1378 states and 4856 transitions. [2020-02-10 20:41:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:36,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:36,113 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 20:41:36,113 INFO L226 Difference]: Without dead ends: 1356 [2020-02-10 20:41:36,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-02-10 20:41:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-02-10 20:41:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 782. [2020-02-10 20:41:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:41:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3130 transitions. [2020-02-10 20:41:36,140 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3130 transitions. Word has length 25 [2020-02-10 20:41:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:36,141 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3130 transitions. [2020-02-10 20:41:36,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:36,141 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3130 transitions. [2020-02-10 20:41:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:36,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:36,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-02-10 20:41:36,143 INFO L427 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-02-10 20:41:36,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:36,143 INFO L82 PathProgramCache]: Analyzing trace with hash -294965901, now seen corresponding path program 103 times [2020-02-10 20:41:36,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:36,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67199818] [2020-02-10 20:41:36,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:36,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67199818] [2020-02-10 20:41:36,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:36,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:36,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822217698] [2020-02-10 20:41:36,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:36,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:36,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:36,540 INFO L87 Difference]: Start difference. First operand 782 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:41:36,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:36,702 INFO L93 Difference]: Finished difference Result 1373 states and 4851 transitions. [2020-02-10 20:41:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:36,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:36,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:36,706 INFO L225 Difference]: With dead ends: 1373 [2020-02-10 20:41:36,706 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:41:36,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-02-10 20:41:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:41:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-02-10 20:41:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 20:41:36,731 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 20:41:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:36,731 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 20:41:36,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 20:41:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:36,732 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:36,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-02-10 20:41:36,732 INFO L427 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-02-10 20:41:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:36,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1315975057, now seen corresponding path program 104 times [2020-02-10 20:41:36,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:36,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753050181] [2020-02-10 20:41:36,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:37,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753050181] [2020-02-10 20:41:37,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:37,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:37,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385095312] [2020-02-10 20:41:37,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:37,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:37,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:37,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:37,130 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:41:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:37,283 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-02-10 20:41:37,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:37,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:37,288 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:41:37,288 INFO L226 Difference]: Without dead ends: 1355 [2020-02-10 20:41:37,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-02-10 20:41:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-02-10 20:41:37,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 785. [2020-02-10 20:41:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-02-10 20:41:37,313 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-02-10 20:41:37,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:37,313 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-02-10 20:41:37,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-02-10 20:41:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:37,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:37,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-02-10 20:41:37,316 INFO L427 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-02-10 20:41:37,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:37,316 INFO L82 PathProgramCache]: Analyzing trace with hash 799125687, now seen corresponding path program 105 times [2020-02-10 20:41:37,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:37,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147097699] [2020-02-10 20:41:37,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:37,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147097699] [2020-02-10 20:41:37,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:37,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:37,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255889620] [2020-02-10 20:41:37,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:37,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:37,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:37,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:37,754 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:41:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:37,905 INFO L93 Difference]: Finished difference Result 1377 states and 4858 transitions. [2020-02-10 20:41:37,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:37,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:37,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:37,908 INFO L225 Difference]: With dead ends: 1377 [2020-02-10 20:41:37,908 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 20:41:37,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 20:41:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 790. [2020-02-10 20:41:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:41:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3147 transitions. [2020-02-10 20:41:37,937 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3147 transitions. Word has length 25 [2020-02-10 20:41:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:37,938 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3147 transitions. [2020-02-10 20:41:37,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3147 transitions. [2020-02-10 20:41:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:37,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:37,940 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:37,940 INFO L427 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-02-10 20:41:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:37,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1336981265, now seen corresponding path program 106 times [2020-02-10 20:41:37,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:37,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495223984] [2020-02-10 20:41:37,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:38,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495223984] [2020-02-10 20:41:38,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:38,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:38,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747422479] [2020-02-10 20:41:38,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:38,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:38,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:38,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:38,345 INFO L87 Difference]: Start difference. First operand 790 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:41:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:38,487 INFO L93 Difference]: Finished difference Result 1376 states and 4851 transitions. [2020-02-10 20:41:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:38,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:38,492 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:41:38,492 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 20:41:38,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-02-10 20:41:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 20:41:38,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 785. [2020-02-10 20:41:38,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-02-10 20:41:38,526 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-02-10 20:41:38,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:38,526 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-02-10 20:41:38,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-02-10 20:41:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:38,527 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:38,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-02-10 20:41:38,527 INFO L427 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-02-10 20:41:38,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:38,528 INFO L82 PathProgramCache]: Analyzing trace with hash 809628791, now seen corresponding path program 107 times [2020-02-10 20:41:38,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:38,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681015303] [2020-02-10 20:41:38,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:38,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681015303] [2020-02-10 20:41:38,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:38,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:38,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913727367] [2020-02-10 20:41:38,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:38,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:38,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:38,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:38,915 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:41:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:39,075 INFO L93 Difference]: Finished difference Result 1369 states and 4837 transitions. [2020-02-10 20:41:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:39,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:39,079 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 20:41:39,079 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 20:41:39,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-02-10 20:41:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 20:41:39,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 788. [2020-02-10 20:41:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-02-10 20:41:39,103 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-02-10 20:41:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:39,103 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-02-10 20:41:39,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-02-10 20:41:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:39,104 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:39,104 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:39,104 INFO L427 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-02-10 20:41:39,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:39,105 INFO L82 PathProgramCache]: Analyzing trace with hash -263456589, now seen corresponding path program 108 times [2020-02-10 20:41:39,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:39,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664564085] [2020-02-10 20:41:39,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:39,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664564085] [2020-02-10 20:41:39,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:39,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:39,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479390191] [2020-02-10 20:41:39,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:39,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:39,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:39,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:39,496 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:41:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:39,643 INFO L93 Difference]: Finished difference Result 1371 states and 4838 transitions. [2020-02-10 20:41:39,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:39,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:39,647 INFO L225 Difference]: With dead ends: 1371 [2020-02-10 20:41:39,647 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 20:41:39,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-02-10 20:41:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 20:41:39,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 782. [2020-02-10 20:41:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:41:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-02-10 20:41:39,672 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-02-10 20:41:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:39,672 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-02-10 20:41:39,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-02-10 20:41:39,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:39,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:39,673 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:39,673 INFO L427 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-02-10 20:41:39,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:39,674 INFO L82 PathProgramCache]: Analyzing trace with hash 30630323, now seen corresponding path program 109 times [2020-02-10 20:41:39,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:39,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985220291] [2020-02-10 20:41:39,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:40,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985220291] [2020-02-10 20:41:40,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:40,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:40,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64551412] [2020-02-10 20:41:40,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:40,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:40,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:40,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:40,073 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:41:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:40,241 INFO L93 Difference]: Finished difference Result 1391 states and 4896 transitions. [2020-02-10 20:41:40,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:40,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:40,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:40,245 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 20:41:40,245 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:41:40,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-02-10 20:41:40,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:41:40,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 793. [2020-02-10 20:41:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:41:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-02-10 20:41:40,269 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-02-10 20:41:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:40,269 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-02-10 20:41:40,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-02-10 20:41:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:40,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:40,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-02-10 20:41:40,270 INFO L427 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-02-10 20:41:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1042455057, now seen corresponding path program 110 times [2020-02-10 20:41:40,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:40,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517643268] [2020-02-10 20:41:40,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:40,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517643268] [2020-02-10 20:41:40,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:40,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:40,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661011197] [2020-02-10 20:41:40,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:40,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:40,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:40,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:40,669 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:41:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:40,826 INFO L93 Difference]: Finished difference Result 1392 states and 4892 transitions. [2020-02-10 20:41:40,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:40,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:40,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:40,830 INFO L225 Difference]: With dead ends: 1392 [2020-02-10 20:41:40,830 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 20:41:40,830 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 20:41:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-02-10 20:41:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:41:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-02-10 20:41:40,853 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-02-10 20:41:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:40,854 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-02-10 20:41:40,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-02-10 20:41:40,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:40,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:40,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-02-10 20:41:40,855 INFO L427 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-02-10 20:41:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1569807531, now seen corresponding path program 111 times [2020-02-10 20:41:40,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:40,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525137686] [2020-02-10 20:41:40,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:41,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525137686] [2020-02-10 20:41:41,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:41,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:41,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307655591] [2020-02-10 20:41:41,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:41,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:41,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:41,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:41,283 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:41:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:41,437 INFO L93 Difference]: Finished difference Result 1388 states and 4884 transitions. [2020-02-10 20:41:41,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:41,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:41,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:41,441 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 20:41:41,442 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 20:41:41,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 20:41:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 792. [2020-02-10 20:41:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:41:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3150 transitions. [2020-02-10 20:41:41,467 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3150 transitions. Word has length 25 [2020-02-10 20:41:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:41,467 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3150 transitions. [2020-02-10 20:41:41,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3150 transitions. [2020-02-10 20:41:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:41,468 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:41,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-02-10 20:41:41,469 INFO L427 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-02-10 20:41:41,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:41,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1031951953, now seen corresponding path program 112 times [2020-02-10 20:41:41,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:41,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461704780] [2020-02-10 20:41:41,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41: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-02-10 20:41:41,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461704780] [2020-02-10 20:41:41,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:41,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:41,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459254650] [2020-02-10 20:41:41,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:41,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:41,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:41,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:41,886 INFO L87 Difference]: Start difference. First operand 792 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:41:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:42,036 INFO L93 Difference]: Finished difference Result 1387 states and 4877 transitions. [2020-02-10 20:41:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:42,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:42,039 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:41:42,040 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:41:42,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:41:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-02-10 20:41:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:41:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3136 transitions. [2020-02-10 20:41:42,064 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3136 transitions. Word has length 25 [2020-02-10 20:41:42,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:42,064 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3136 transitions. [2020-02-10 20:41:42,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3136 transitions. [2020-02-10 20:41:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:42,065 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:42,066 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:42,066 INFO L427 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-02-10 20:41:42,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:42,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1548801323, now seen corresponding path program 113 times [2020-02-10 20:41:42,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:42,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2904715] [2020-02-10 20:41:42,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:42,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2904715] [2020-02-10 20:41:42,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:42,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:42,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043135419] [2020-02-10 20:41:42,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:42,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:42,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:42,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:42,467 INFO L87 Difference]: Start difference. First operand 787 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:41:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:42,603 INFO L93 Difference]: Finished difference Result 1390 states and 4883 transitions. [2020-02-10 20:41:42,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:42,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:42,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:42,607 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:41:42,608 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 20:41:42,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 20:41:42,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 792. [2020-02-10 20:41:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:41:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 20:41:42,635 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 20:41:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:42,636 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 20:41:42,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 20:41:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:42,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:42,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-02-10 20:41:42,638 INFO L427 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-02-10 20:41:42,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:42,638 INFO L82 PathProgramCache]: Analyzing trace with hash 62139635, now seen corresponding path program 114 times [2020-02-10 20:41:42,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:42,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616022630] [2020-02-10 20:41:42,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:43,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616022630] [2020-02-10 20:41:43,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:43,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:43,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203248174] [2020-02-10 20:41:43,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:43,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:43,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:43,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:43,060 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:41:43,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:43,229 INFO L93 Difference]: Finished difference Result 1388 states and 4874 transitions. [2020-02-10 20:41:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:43,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:43,233 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 20:41:43,233 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 20:41:43,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:43,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 20:41:43,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 782. [2020-02-10 20:41:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:41:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3124 transitions. [2020-02-10 20:41:43,257 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3124 transitions. Word has length 25 [2020-02-10 20:41:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:43,257 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3124 transitions. [2020-02-10 20:41:43,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3124 transitions. [2020-02-10 20:41:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:43,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:43,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-02-10 20:41:43,258 INFO L427 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-02-10 20:41:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:43,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1967167505, now seen corresponding path program 115 times [2020-02-10 20:41:43,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:43,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178673124] [2020-02-10 20:41:43,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41: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-02-10 20:41:43,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178673124] [2020-02-10 20:41:43,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:43,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:43,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803748660] [2020-02-10 20:41:43,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:43,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:43,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:43,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:43,631 INFO L87 Difference]: Start difference. First operand 782 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:41:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:43,775 INFO L93 Difference]: Finished difference Result 1372 states and 4843 transitions. [2020-02-10 20:41:43,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:43,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:43,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:43,779 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 20:41:43,779 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 20:41:43,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 20:41:43,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 788. [2020-02-10 20:41:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-02-10 20:41:43,803 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-02-10 20:41:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:43,803 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-02-10 20:41:43,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-02-10 20:41:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:43,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:43,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-02-10 20:41:43,805 INFO L427 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-02-10 20:41:43,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:43,805 INFO L82 PathProgramCache]: Analyzing trace with hash -716858833, now seen corresponding path program 116 times [2020-02-10 20:41:43,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:43,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493689883] [2020-02-10 20:41:43,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:44,254 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 25 [2020-02-10 20:41:44,449 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2020-02-10 20:41:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:44,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493689883] [2020-02-10 20:41:44,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:44,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:44,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462079789] [2020-02-10 20:41:44,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:44,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:44,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:44,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:44,460 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:41:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:44,642 INFO L93 Difference]: Finished difference Result 1376 states and 4848 transitions. [2020-02-10 20:41:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:44,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:44,648 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:41:44,648 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 20:41:44,649 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-02-10 20:41:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 20:41:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 785. [2020-02-10 20:41:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3132 transitions. [2020-02-10 20:41:44,707 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3132 transitions. Word has length 25 [2020-02-10 20:41:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:44,707 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3132 transitions. [2020-02-10 20:41:44,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3132 transitions. [2020-02-10 20:41:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:44,710 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:44,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-02-10 20:41:44,711 INFO L427 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-02-10 20:41:44,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:44,711 INFO L82 PathProgramCache]: Analyzing trace with hash 366729651, now seen corresponding path program 117 times [2020-02-10 20:41:44,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:44,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648579834] [2020-02-10 20:41:44,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:45,142 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 26 [2020-02-10 20:41:45,278 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2020-02-10 20:41:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:45,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648579834] [2020-02-10 20:41:45,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:45,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:45,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697784731] [2020-02-10 20:41:45,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:45,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:45,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:45,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:45,290 INFO L87 Difference]: Start difference. First operand 785 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:41:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:45,528 INFO L93 Difference]: Finished difference Result 1370 states and 4836 transitions. [2020-02-10 20:41:45,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:45,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:45,534 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:41:45,534 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:41:45,534 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-02-10 20:41:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:41:45,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-02-10 20:41:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3137 transitions. [2020-02-10 20:41:45,607 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3137 transitions. Word has length 25 [2020-02-10 20:41:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:45,608 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3137 transitions. [2020-02-10 20:41:45,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3137 transitions. [2020-02-10 20:41:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:45,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:45,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-02-10 20:41:45,612 INFO L427 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-02-10 20:41:45,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:45,612 INFO L82 PathProgramCache]: Analyzing trace with hash -706355729, now seen corresponding path program 118 times [2020-02-10 20:41:45,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:45,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816373726] [2020-02-10 20:41:45,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:46,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816373726] [2020-02-10 20:41:46,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:46,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:46,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487361680] [2020-02-10 20:41:46,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:46,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:46,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:46,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:46,052 INFO L87 Difference]: Start difference. First operand 788 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:41:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:46,211 INFO L93 Difference]: Finished difference Result 1372 states and 4837 transitions. [2020-02-10 20:41:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:46,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:46,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:46,215 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 20:41:46,216 INFO L226 Difference]: Without dead ends: 1355 [2020-02-10 20:41:46,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-02-10 20:41:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-02-10 20:41:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 785. [2020-02-10 20:41:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3129 transitions. [2020-02-10 20:41:46,240 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3129 transitions. Word has length 25 [2020-02-10 20:41:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:46,240 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3129 transitions. [2020-02-10 20:41:46,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3129 transitions. [2020-02-10 20:41:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:46,241 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:46,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-02-10 20:41:46,242 INFO L427 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-02-10 20:41:46,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:46,242 INFO L82 PathProgramCache]: Analyzing trace with hash 377232755, now seen corresponding path program 119 times [2020-02-10 20:41:46,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:46,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654920731] [2020-02-10 20:41:46,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:46,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-02-10 20:41:46,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654920731] [2020-02-10 20:41:46,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:46,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:46,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568285576] [2020-02-10 20:41:46,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:46,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:46,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:46,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:46,630 INFO L87 Difference]: Start difference. First operand 785 states and 3129 transitions. Second operand 10 states. [2020-02-10 20:41:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:46,802 INFO L93 Difference]: Finished difference Result 1380 states and 4855 transitions. [2020-02-10 20:41:46,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:46,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:46,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:46,806 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 20:41:46,807 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 20:41:46,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 20:41:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 790. [2020-02-10 20:41:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:41:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3138 transitions. [2020-02-10 20:41:46,831 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3138 transitions. Word has length 25 [2020-02-10 20:41:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:46,831 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3138 transitions. [2020-02-10 20:41:46,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3138 transitions. [2020-02-10 20:41:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:46,832 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:46,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-02-10 20:41:46,832 INFO L427 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-02-10 20:41:46,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:46,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1988173713, now seen corresponding path program 120 times [2020-02-10 20:41:46,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:46,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241691871] [2020-02-10 20:41:46,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:47,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241691871] [2020-02-10 20:41:47,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:47,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:47,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562835896] [2020-02-10 20:41:47,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:47,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:47,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:47,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:47,224 INFO L87 Difference]: Start difference. First operand 790 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:41:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:47,374 INFO L93 Difference]: Finished difference Result 1378 states and 4846 transitions. [2020-02-10 20:41:47,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:47,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:47,378 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 20:41:47,378 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:41:47,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-02-10 20:41:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:41:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 776. [2020-02-10 20:41:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:41:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3111 transitions. [2020-02-10 20:41:47,402 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3111 transitions. Word has length 25 [2020-02-10 20:41:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:47,402 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3111 transitions. [2020-02-10 20:41:47,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3111 transitions. [2020-02-10 20:41:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:47,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:47,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:47,404 INFO L427 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-02-10 20:41:47,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:47,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1635199863, now seen corresponding path program 121 times [2020-02-10 20:41:47,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:47,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497565395] [2020-02-10 20:41:47,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:47,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497565395] [2020-02-10 20:41:47,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:47,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:47,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060490128] [2020-02-10 20:41:47,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:47,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:47,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:47,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:47,800 INFO L87 Difference]: Start difference. First operand 776 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:41:47,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:47,945 INFO L93 Difference]: Finished difference Result 1402 states and 4942 transitions. [2020-02-10 20:41:47,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:47,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:47,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:47,950 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 20:41:47,950 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:41:47,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-02-10 20:41:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:41:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 792. [2020-02-10 20:41:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:41:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3172 transitions. [2020-02-10 20:41:47,975 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3172 transitions. Word has length 25 [2020-02-10 20:41:47,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:47,975 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3172 transitions. [2020-02-10 20:41:47,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3172 transitions. [2020-02-10 20:41:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:47,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:47,977 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:47,977 INFO L427 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-02-10 20:41:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:47,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1689515819, now seen corresponding path program 122 times [2020-02-10 20:41:47,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:47,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608321338] [2020-02-10 20:41:47,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:48,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608321338] [2020-02-10 20:41:48,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:48,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:48,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274211676] [2020-02-10 20:41:48,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:48,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:48,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:48,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:48,379 INFO L87 Difference]: Start difference. First operand 792 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:41:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:48,553 INFO L93 Difference]: Finished difference Result 1404 states and 4942 transitions. [2020-02-10 20:41:48,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:48,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:48,556 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 20:41:48,557 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:41:48,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:48,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:41:48,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-02-10 20:41:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3162 transitions. [2020-02-10 20:41:48,581 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3162 transitions. Word has length 25 [2020-02-10 20:41:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:48,581 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3162 transitions. [2020-02-10 20:41:48,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3162 transitions. [2020-02-10 20:41:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:48,583 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:48,583 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:48,583 INFO L427 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-02-10 20:41:48,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:48,583 INFO L82 PathProgramCache]: Analyzing trace with hash -733733355, now seen corresponding path program 123 times [2020-02-10 20:41:48,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:48,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14640044] [2020-02-10 20:41:48,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:49,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14640044] [2020-02-10 20:41:49,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:49,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:49,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396627171] [2020-02-10 20:41:49,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:49,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:49,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:49,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:49,006 INFO L87 Difference]: Start difference. First operand 788 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:41:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:49,170 INFO L93 Difference]: Finished difference Result 1398 states and 4930 transitions. [2020-02-10 20:41:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:49,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:49,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:49,174 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 20:41:49,174 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:41:49,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:41:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 791. [2020-02-10 20:41:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:41:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3167 transitions. [2020-02-10 20:41:49,198 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3167 transitions. Word has length 25 [2020-02-10 20:41:49,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:49,198 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3167 transitions. [2020-02-10 20:41:49,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3167 transitions. [2020-02-10 20:41:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:49,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:49,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-02-10 20:41:49,200 INFO L427 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-02-10 20:41:49,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:49,200 INFO L82 PathProgramCache]: Analyzing trace with hash 247021363, now seen corresponding path program 124 times [2020-02-10 20:41:49,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:49,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441315712] [2020-02-10 20:41:49,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:49,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441315712] [2020-02-10 20:41:49,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:49,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:49,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702987322] [2020-02-10 20:41:49,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:49,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:49,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:49,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:49,780 INFO L87 Difference]: Start difference. First operand 791 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:41:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:49,957 INFO L93 Difference]: Finished difference Result 1397 states and 4925 transitions. [2020-02-10 20:41:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:49,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:49,961 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 20:41:49,962 INFO L226 Difference]: Without dead ends: 1382 [2020-02-10 20:41:49,962 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-02-10 20:41:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-02-10 20:41:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 788. [2020-02-10 20:41:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3159 transitions. [2020-02-10 20:41:49,987 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3159 transitions. Word has length 25 [2020-02-10 20:41:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:49,987 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3159 transitions. [2020-02-10 20:41:49,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3159 transitions. [2020-02-10 20:41:49,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:49,989 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:49,989 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:49,989 INFO L427 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-02-10 20:41:49,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:49,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1350890633, now seen corresponding path program 125 times [2020-02-10 20:41:49,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:49,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804919181] [2020-02-10 20:41:49,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:50,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804919181] [2020-02-10 20:41:50,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:50,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:50,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143776001] [2020-02-10 20:41:50,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:50,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:50,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:50,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:50,497 INFO L87 Difference]: Start difference. First operand 788 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:41:50,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:50,715 INFO L93 Difference]: Finished difference Result 1402 states and 4935 transitions. [2020-02-10 20:41:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:50,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:50,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:50,721 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 20:41:50,721 INFO L226 Difference]: Without dead ends: 1387 [2020-02-10 20:41:50,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-02-10 20:41:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-02-10 20:41:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 791. [2020-02-10 20:41:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:41:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3164 transitions. [2020-02-10 20:41:50,774 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3164 transitions. Word has length 25 [2020-02-10 20:41:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:50,775 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3164 transitions. [2020-02-10 20:41:50,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3164 transitions. [2020-02-10 20:41:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:50,778 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:50,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-02-10 20:41:50,778 INFO L427 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-02-10 20:41:50,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:50,779 INFO L82 PathProgramCache]: Analyzing trace with hash 260050325, now seen corresponding path program 126 times [2020-02-10 20:41:50,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:50,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287228677] [2020-02-10 20:41:50,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:51,225 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2020-02-10 20:41:51,358 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-02-10 20:41:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:51,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287228677] [2020-02-10 20:41:51,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:51,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:51,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121210049] [2020-02-10 20:41:51,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:51,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:51,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:51,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:51,370 INFO L87 Difference]: Start difference. First operand 791 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:41:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:51,575 INFO L93 Difference]: Finished difference Result 1399 states and 4926 transitions. [2020-02-10 20:41:51,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:51,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:51,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:51,581 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 20:41:51,581 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 20:41:51,581 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-02-10 20:41:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 20:41:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 785. [2020-02-10 20:41:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3151 transitions. [2020-02-10 20:41:51,633 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3151 transitions. Word has length 25 [2020-02-10 20:41:51,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:51,633 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3151 transitions. [2020-02-10 20:41:51,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3151 transitions. [2020-02-10 20:41:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:51,636 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:51,636 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:51,636 INFO L427 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-02-10 20:41:51,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:51,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1212714137, now seen corresponding path program 127 times [2020-02-10 20:41:51,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:51,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732717229] [2020-02-10 20:41:51,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:52,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732717229] [2020-02-10 20:41:52,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:52,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:52,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483798049] [2020-02-10 20:41:52,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:52,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:52,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:52,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:52,107 INFO L87 Difference]: Start difference. First operand 785 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:41:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:52,270 INFO L93 Difference]: Finished difference Result 1411 states and 4963 transitions. [2020-02-10 20:41:52,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:52,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:52,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:52,275 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:41:52,275 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:41:52,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-02-10 20:41:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:41:52,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 20:41:52,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:41:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3173 transitions. [2020-02-10 20:41:52,299 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3173 transitions. Word has length 25 [2020-02-10 20:41:52,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:52,299 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3173 transitions. [2020-02-10 20:41:52,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3173 transitions. [2020-02-10 20:41:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:52,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:52,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-02-10 20:41:52,301 INFO L427 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-02-10 20:41:52,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:52,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2112001545, now seen corresponding path program 128 times [2020-02-10 20:41:52,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:52,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148326798] [2020-02-10 20:41:52,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:52,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148326798] [2020-02-10 20:41:52,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:52,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:52,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657224185] [2020-02-10 20:41:52,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:52,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:52,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:52,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:52,704 INFO L87 Difference]: Start difference. First operand 793 states and 3173 transitions. Second operand 10 states. [2020-02-10 20:41:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:52,865 INFO L93 Difference]: Finished difference Result 1413 states and 4963 transitions. [2020-02-10 20:41:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:52,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:52,869 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 20:41:52,869 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:41:52,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:52,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:41:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 20:41:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:41:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3162 transitions. [2020-02-10 20:41:52,893 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3162 transitions. Word has length 25 [2020-02-10 20:41:52,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:52,894 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3162 transitions. [2020-02-10 20:41:52,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3162 transitions. [2020-02-10 20:41:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:52,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:52,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-02-10 20:41:52,895 INFO L427 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-02-10 20:41:52,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash 769814997, now seen corresponding path program 129 times [2020-02-10 20:41:52,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:52,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245795196] [2020-02-10 20:41:52,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:53,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245795196] [2020-02-10 20:41:53,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:53,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:53,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613849874] [2020-02-10 20:41:53,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:53,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:53,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:53,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:53,321 INFO L87 Difference]: Start difference. First operand 789 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:41:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:53,476 INFO L93 Difference]: Finished difference Result 1412 states and 4961 transitions. [2020-02-10 20:41:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:53,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:53,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:53,480 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:41:53,480 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:41:53,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:41:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 793. [2020-02-10 20:41:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:41:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3169 transitions. [2020-02-10 20:41:53,504 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3169 transitions. Word has length 25 [2020-02-10 20:41:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:53,505 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3169 transitions. [2020-02-10 20:41:53,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3169 transitions. [2020-02-10 20:41:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:53,506 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:53,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-02-10 20:41:53,506 INFO L427 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-02-10 20:41:53,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:53,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1761072819, now seen corresponding path program 130 times [2020-02-10 20:41:53,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:53,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719336420] [2020-02-10 20:41:53,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:53,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719336420] [2020-02-10 20:41:53,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:53,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:53,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499421988] [2020-02-10 20:41:53,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:53,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:53,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:53,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:53,900 INFO L87 Difference]: Start difference. First operand 793 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:41:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:54,104 INFO L93 Difference]: Finished difference Result 1415 states and 4963 transitions. [2020-02-10 20:41:54,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:54,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:54,109 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 20:41:54,109 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 20:41:54,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-02-10 20:41:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 20:41:54,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 789. [2020-02-10 20:41:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:41:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3158 transitions. [2020-02-10 20:41:54,139 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3158 transitions. Word has length 25 [2020-02-10 20:41:54,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:54,139 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3158 transitions. [2020-02-10 20:41:54,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3158 transitions. [2020-02-10 20:41:54,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:54,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:54,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-02-10 20:41:54,141 INFO L427 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-02-10 20:41:54,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:54,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1447780135, now seen corresponding path program 131 times [2020-02-10 20:41:54,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:54,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676116718] [2020-02-10 20:41:54,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:54,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676116718] [2020-02-10 20:41:54,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:54,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:54,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137379347] [2020-02-10 20:41:54,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:54,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:54,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:54,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:54,543 INFO L87 Difference]: Start difference. First operand 789 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:41:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:54,694 INFO L93 Difference]: Finished difference Result 1418 states and 4971 transitions. [2020-02-10 20:41:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:54,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:54,698 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:41:54,698 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:41:54,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-02-10 20:41:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:41:54,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 795. [2020-02-10 20:41:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:41:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3169 transitions. [2020-02-10 20:41:54,723 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3169 transitions. Word has length 25 [2020-02-10 20:41:54,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:54,723 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3169 transitions. [2020-02-10 20:41:54,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3169 transitions. [2020-02-10 20:41:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:54,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:54,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-02-10 20:41:54,725 INFO L427 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-02-10 20:41:54,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:54,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1774101781, now seen corresponding path program 132 times [2020-02-10 20:41:54,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:54,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623799360] [2020-02-10 20:41:54,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:55,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623799360] [2020-02-10 20:41:55,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:55,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:55,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641545109] [2020-02-10 20:41:55,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:55,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:55,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:55,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:55,126 INFO L87 Difference]: Start difference. First operand 795 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:41:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:55,329 INFO L93 Difference]: Finished difference Result 1419 states and 4967 transitions. [2020-02-10 20:41:55,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:55,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:55,333 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:41:55,333 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:41:55,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-02-10 20:41:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:41:55,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 785. [2020-02-10 20:41:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3148 transitions. [2020-02-10 20:41:55,357 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3148 transitions. Word has length 25 [2020-02-10 20:41:55,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:55,358 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3148 transitions. [2020-02-10 20:41:55,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3148 transitions. [2020-02-10 20:41:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:55,359 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:55,359 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:55,359 INFO L427 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-02-10 20:41:55,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:55,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1578704807, now seen corresponding path program 133 times [2020-02-10 20:41:55,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:55,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983500972] [2020-02-10 20:41:55,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:55,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983500972] [2020-02-10 20:41:55,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:55,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:55,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130840606] [2020-02-10 20:41:55,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:55,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:55,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:55,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:55,777 INFO L87 Difference]: Start difference. First operand 785 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:41:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:55,972 INFO L93 Difference]: Finished difference Result 1399 states and 4929 transitions. [2020-02-10 20:41:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:55,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:55,976 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 20:41:55,976 INFO L226 Difference]: Without dead ends: 1386 [2020-02-10 20:41:55,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-02-10 20:41:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 791. [2020-02-10 20:41:55,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:41:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3164 transitions. [2020-02-10 20:41:56,000 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3164 transitions. Word has length 25 [2020-02-10 20:41:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:56,000 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3164 transitions. [2020-02-10 20:41:56,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3164 transitions. [2020-02-10 20:41:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:56,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:56,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-02-10 20:41:56,001 INFO L427 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-02-10 20:41:56,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:56,001 INFO L82 PathProgramCache]: Analyzing trace with hash -597950089, now seen corresponding path program 134 times [2020-02-10 20:41:56,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:56,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027945821] [2020-02-10 20:41:56,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:56,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027945821] [2020-02-10 20:41:56,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:56,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:56,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093392574] [2020-02-10 20:41:56,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:56,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:56,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:56,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:56,428 INFO L87 Difference]: Start difference. First operand 791 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:41:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:56,626 INFO L93 Difference]: Finished difference Result 1398 states and 4924 transitions. [2020-02-10 20:41:56,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:56,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:56,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:56,630 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 20:41:56,631 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:41:56,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:41:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-02-10 20:41:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3156 transitions. [2020-02-10 20:41:56,655 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3156 transitions. Word has length 25 [2020-02-10 20:41:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:56,655 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3156 transitions. [2020-02-10 20:41:56,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3156 transitions. [2020-02-10 20:41:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:56,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:56,656 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:41:56,656 INFO L427 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-02-10 20:41:56,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:56,656 INFO L82 PathProgramCache]: Analyzing trace with hash 347329271, now seen corresponding path program 135 times [2020-02-10 20:41:56,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:56,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248337544] [2020-02-10 20:41:56,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:57,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248337544] [2020-02-10 20:41:57,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:57,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:57,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566799037] [2020-02-10 20:41:57,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:57,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:57,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:57,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:57,160 INFO L87 Difference]: Start difference. First operand 788 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:41:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:57,305 INFO L93 Difference]: Finished difference Result 1404 states and 4937 transitions. [2020-02-10 20:41:57,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:57,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:57,309 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 20:41:57,309 INFO L226 Difference]: Without dead ends: 1391 [2020-02-10 20:41:57,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:57,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-02-10 20:41:57,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 792. [2020-02-10 20:41:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:41:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3163 transitions. [2020-02-10 20:41:57,334 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3163 transitions. Word has length 25 [2020-02-10 20:41:57,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:57,334 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3163 transitions. [2020-02-10 20:41:57,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:57,334 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3163 transitions. [2020-02-10 20:41:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:57,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:57,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-02-10 20:41:57,335 INFO L427 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-02-10 20:41:57,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:57,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1338587093, now seen corresponding path program 136 times [2020-02-10 20:41:57,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:57,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100036635] [2020-02-10 20:41:57,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:57,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100036635] [2020-02-10 20:41:57,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:57,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:57,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779382038] [2020-02-10 20:41:57,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:57,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:57,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:57,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:57,734 INFO L87 Difference]: Start difference. First operand 792 states and 3163 transitions. Second operand 10 states. [2020-02-10 20:41:57,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:57,935 INFO L93 Difference]: Finished difference Result 1407 states and 4939 transitions. [2020-02-10 20:41:57,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:57,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:57,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:57,939 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 20:41:57,940 INFO L226 Difference]: Without dead ends: 1387 [2020-02-10 20:41:57,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:41:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-02-10 20:41:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 788. [2020-02-10 20:41:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:41:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3153 transitions. [2020-02-10 20:41:57,963 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3153 transitions. Word has length 25 [2020-02-10 20:41:57,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:57,964 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3153 transitions. [2020-02-10 20:41:57,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3153 transitions. [2020-02-10 20:41:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:57,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:57,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-02-10 20:41:57,965 INFO L427 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-02-10 20:41:57,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:57,965 INFO L82 PathProgramCache]: Analyzing trace with hash 66271321, now seen corresponding path program 137 times [2020-02-10 20:41:57,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:57,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57288494] [2020-02-10 20:41:57,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:58,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-02-10 20:41:58,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57288494] [2020-02-10 20:41:58,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:58,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:58,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45386011] [2020-02-10 20:41:58,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:58,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:58,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:58,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:58,373 INFO L87 Difference]: Start difference. First operand 788 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:41:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:58,573 INFO L93 Difference]: Finished difference Result 1401 states and 4927 transitions. [2020-02-10 20:41:58,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:58,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:58,576 INFO L225 Difference]: With dead ends: 1401 [2020-02-10 20:41:58,577 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:41:58,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-02-10 20:41:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:41:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 791. [2020-02-10 20:41:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:41:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-02-10 20:41:58,600 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-02-10 20:41:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:58,601 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-02-10 20:41:58,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-02-10 20:41:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:58,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:58,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-02-10 20:41:58,602 INFO L427 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-02-10 20:41:58,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:58,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1677212279, now seen corresponding path program 138 times [2020-02-10 20:41:58,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:58,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613698640] [2020-02-10 20:41:58,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:59,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-02-10 20:41:59,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613698640] [2020-02-10 20:41:59,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:59,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:59,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950916447] [2020-02-10 20:41:59,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:59,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:59,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:59,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:59,012 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:41:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:59,174 INFO L93 Difference]: Finished difference Result 1405 states and 4932 transitions. [2020-02-10 20:41:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:59,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:59,178 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 20:41:59,179 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:41:59,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-02-10 20:41:59,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:41:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 785. [2020-02-10 20:41:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:41:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3145 transitions. [2020-02-10 20:41:59,203 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3145 transitions. Word has length 25 [2020-02-10 20:41:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:59,205 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3145 transitions. [2020-02-10 20:41:59,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3145 transitions. [2020-02-10 20:41:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:59,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:59,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-02-10 20:41:59,207 INFO L427 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-02-10 20:41:59,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:59,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2060103893, now seen corresponding path program 139 times [2020-02-10 20:41:59,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:59,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5625595] [2020-02-10 20:41:59,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:41:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:41:59,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5625595] [2020-02-10 20:41:59,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:41:59,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:41:59,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979413785] [2020-02-10 20:41:59,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:41:59,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:41:59,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:41:59,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:41:59,628 INFO L87 Difference]: Start difference. First operand 785 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:41:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:41:59,819 INFO L93 Difference]: Finished difference Result 1407 states and 4944 transitions. [2020-02-10 20:41:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:41:59,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:41:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:41:59,823 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 20:41:59,824 INFO L226 Difference]: Without dead ends: 1392 [2020-02-10 20:41:59,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-02-10 20:41:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-02-10 20:41:59,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 791. [2020-02-10 20:41:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:41:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3161 transitions. [2020-02-10 20:41:59,860 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3161 transitions. Word has length 25 [2020-02-10 20:41:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:41:59,860 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3161 transitions. [2020-02-10 20:41:59,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:41:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3161 transitions. [2020-02-10 20:41:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:41:59,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:41:59,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-02-10 20:41:59,861 INFO L427 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-02-10 20:41:59,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:41:59,862 INFO L82 PathProgramCache]: Analyzing trace with hash -623922445, now seen corresponding path program 140 times [2020-02-10 20:41:59,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:41:59,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471813464] [2020-02-10 20:41:59,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:41:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:00,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471813464] [2020-02-10 20:42:00,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:00,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:00,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616272235] [2020-02-10 20:42:00,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:00,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:00,256 INFO L87 Difference]: Start difference. First operand 791 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:42:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:00,430 INFO L93 Difference]: Finished difference Result 1404 states and 4935 transitions. [2020-02-10 20:42:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:00,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:00,435 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 20:42:00,435 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:42:00,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-02-10 20:42:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:42:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 788. [2020-02-10 20:42:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:42:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3153 transitions. [2020-02-10 20:42:00,459 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3153 transitions. Word has length 25 [2020-02-10 20:42:00,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:00,460 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3153 transitions. [2020-02-10 20:42:00,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3153 transitions. [2020-02-10 20:42:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:00,461 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:00,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-02-10 20:42:00,461 INFO L427 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-02-10 20:42:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:00,461 INFO L82 PathProgramCache]: Analyzing trace with hash 459666039, now seen corresponding path program 141 times [2020-02-10 20:42:00,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:00,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425262472] [2020-02-10 20:42:00,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:00,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425262472] [2020-02-10 20:42:00,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:00,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:00,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498703775] [2020-02-10 20:42:00,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:00,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:00,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:00,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:00,879 INFO L87 Difference]: Start difference. First operand 788 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:42:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:01,055 INFO L93 Difference]: Finished difference Result 1414 states and 4958 transitions. [2020-02-10 20:42:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:01,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:01,059 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:42:01,059 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:42:01,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-02-10 20:42:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:42:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 794. [2020-02-10 20:42:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:42:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-02-10 20:42:01,084 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-02-10 20:42:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:01,084 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-02-10 20:42:01,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:01,084 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-02-10 20:42:01,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:01,085 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:01,085 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:01,085 INFO L427 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-02-10 20:42:01,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:01,086 INFO L82 PathProgramCache]: Analyzing trace with hash -613419341, now seen corresponding path program 142 times [2020-02-10 20:42:01,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:01,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563798134] [2020-02-10 20:42:01,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:01,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563798134] [2020-02-10 20:42:01,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:01,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:01,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009621923] [2020-02-10 20:42:01,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:01,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:01,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:01,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:01,488 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:42:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:01,683 INFO L93 Difference]: Finished difference Result 1415 states and 4954 transitions. [2020-02-10 20:42:01,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:01,684 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:01,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:01,687 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 20:42:01,688 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:42:01,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:01,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:42:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 788. [2020-02-10 20:42:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:42:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3150 transitions. [2020-02-10 20:42:01,712 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3150 transitions. Word has length 25 [2020-02-10 20:42:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:01,712 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3150 transitions. [2020-02-10 20:42:01,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3150 transitions. [2020-02-10 20:42:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:01,713 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:01,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-02-10 20:42:01,713 INFO L427 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-02-10 20:42:01,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:01,714 INFO L82 PathProgramCache]: Analyzing trace with hash 470169143, now seen corresponding path program 143 times [2020-02-10 20:42:01,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:01,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325072698] [2020-02-10 20:42:01,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:02,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325072698] [2020-02-10 20:42:02,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:02,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:02,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616450545] [2020-02-10 20:42:02,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:02,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:02,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:02,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:02,115 INFO L87 Difference]: Start difference. First operand 788 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:42:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:02,309 INFO L93 Difference]: Finished difference Result 1405 states and 4934 transitions. [2020-02-10 20:42:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:02,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:02,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:02,313 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 20:42:02,314 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:42:02,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-02-10 20:42:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:42:02,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 791. [2020-02-10 20:42:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:42:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-02-10 20:42:02,338 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-02-10 20:42:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:02,339 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-02-10 20:42:02,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-02-10 20:42:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:02,340 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:02,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-02-10 20:42:02,340 INFO L427 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-02-10 20:42:02,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:02,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2081110101, now seen corresponding path program 144 times [2020-02-10 20:42:02,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:02,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382253656] [2020-02-10 20:42:02,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:02,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382253656] [2020-02-10 20:42:02,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:02,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:02,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320033734] [2020-02-10 20:42:02,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:02,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:02,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:02,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:02,818 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:42:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:03,004 INFO L93 Difference]: Finished difference Result 1409 states and 4939 transitions. [2020-02-10 20:42:03,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:03,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:03,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:03,007 INFO L225 Difference]: With dead ends: 1409 [2020-02-10 20:42:03,007 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 20:42:03,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:03,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 20:42:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 782. [2020-02-10 20:42:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:42:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3137 transitions. [2020-02-10 20:42:03,030 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3137 transitions. Word has length 25 [2020-02-10 20:42:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:03,031 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3137 transitions. [2020-02-10 20:42:03,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3137 transitions. [2020-02-10 20:42:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:03,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:03,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-02-10 20:42:03,032 INFO L427 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-02-10 20:42:03,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:03,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1210888627, now seen corresponding path program 145 times [2020-02-10 20:42:03,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:03,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277912456] [2020-02-10 20:42:03,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42: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-02-10 20:42:03,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277912456] [2020-02-10 20:42:03,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:03,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:03,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703448670] [2020-02-10 20:42:03,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:03,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:03,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:03,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:03,427 INFO L87 Difference]: Start difference. First operand 782 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:42:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:03,628 INFO L93 Difference]: Finished difference Result 1411 states and 4961 transitions. [2020-02-10 20:42:03,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:03,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:03,632 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:42:03,632 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:42:03,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-02-10 20:42:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:42:03,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 20:42:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:42:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3173 transitions. [2020-02-10 20:42:03,657 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3173 transitions. Word has length 25 [2020-02-10 20:42:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:03,657 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3173 transitions. [2020-02-10 20:42:03,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3173 transitions. [2020-02-10 20:42:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:03,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:03,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-02-10 20:42:03,659 INFO L427 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-02-10 20:42:03,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:03,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2113827055, now seen corresponding path program 146 times [2020-02-10 20:42:03,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:03,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282626486] [2020-02-10 20:42:03,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:04,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282626486] [2020-02-10 20:42:04,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:04,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:04,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125215394] [2020-02-10 20:42:04,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:04,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:04,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:04,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:04,053 INFO L87 Difference]: Start difference. First operand 793 states and 3173 transitions. Second operand 10 states. [2020-02-10 20:42:04,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:04,254 INFO L93 Difference]: Finished difference Result 1413 states and 4961 transitions. [2020-02-10 20:42:04,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:04,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:04,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:04,258 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 20:42:04,258 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:42:04,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:04,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:42:04,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 20:42:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:42:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3163 transitions. [2020-02-10 20:42:04,282 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3163 transitions. Word has length 25 [2020-02-10 20:42:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:04,282 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3163 transitions. [2020-02-10 20:42:04,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3163 transitions. [2020-02-10 20:42:04,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:04,283 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:04,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-02-10 20:42:04,283 INFO L427 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-02-10 20:42:04,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:04,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1158044591, now seen corresponding path program 147 times [2020-02-10 20:42:04,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:04,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358077440] [2020-02-10 20:42:04,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:04,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358077440] [2020-02-10 20:42:04,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:04,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:04,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844759913] [2020-02-10 20:42:04,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:04,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:04,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:04,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:04,679 INFO L87 Difference]: Start difference. First operand 789 states and 3163 transitions. Second operand 10 states. [2020-02-10 20:42:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:04,829 INFO L93 Difference]: Finished difference Result 1407 states and 4949 transitions. [2020-02-10 20:42:04,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:04,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:04,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:04,833 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 20:42:04,833 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:42:04,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:04,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:42:04,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 792. [2020-02-10 20:42:04,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:42:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3168 transitions. [2020-02-10 20:42:04,857 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3168 transitions. Word has length 25 [2020-02-10 20:42:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:04,857 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3168 transitions. [2020-02-10 20:42:04,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:04,857 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3168 transitions. [2020-02-10 20:42:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:04,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:04,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-02-10 20:42:04,858 INFO L427 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-02-10 20:42:04,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:04,858 INFO L82 PathProgramCache]: Analyzing trace with hash -177289873, now seen corresponding path program 148 times [2020-02-10 20:42:04,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:04,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231008225] [2020-02-10 20:42:04,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:05,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231008225] [2020-02-10 20:42:05,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:05,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:05,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934636568] [2020-02-10 20:42:05,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:05,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:05,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:05,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:05,258 INFO L87 Difference]: Start difference. First operand 792 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:42:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:05,461 INFO L93 Difference]: Finished difference Result 1406 states and 4944 transitions. [2020-02-10 20:42:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:05,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:05,465 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 20:42:05,465 INFO L226 Difference]: Without dead ends: 1391 [2020-02-10 20:42:05,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-02-10 20:42:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-02-10 20:42:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 789. [2020-02-10 20:42:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:42:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3160 transitions. [2020-02-10 20:42:05,489 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3160 transitions. Word has length 25 [2020-02-10 20:42:05,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:05,490 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3160 transitions. [2020-02-10 20:42:05,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3160 transitions. [2020-02-10 20:42:05,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:05,491 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:05,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-02-10 20:42:05,491 INFO L427 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-02-10 20:42:05,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:05,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1775201869, now seen corresponding path program 149 times [2020-02-10 20:42:05,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:05,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934823333] [2020-02-10 20:42:05,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:05,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934823333] [2020-02-10 20:42:05,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:05,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:05,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342775211] [2020-02-10 20:42:05,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:05,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:05,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:05,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:05,889 INFO L87 Difference]: Start difference. First operand 789 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:42:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:06,044 INFO L93 Difference]: Finished difference Result 1411 states and 4954 transitions. [2020-02-10 20:42:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:06,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:06,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:06,048 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:42:06,048 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:42:06,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-02-10 20:42:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:42:06,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-02-10 20:42:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:42:06,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3165 transitions. [2020-02-10 20:42:06,071 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3165 transitions. Word has length 25 [2020-02-10 20:42:06,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:06,071 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3165 transitions. [2020-02-10 20:42:06,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3165 transitions. [2020-02-10 20:42:06,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:06,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:06,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-02-10 20:42:06,073 INFO L427 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-02-10 20:42:06,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:06,073 INFO L82 PathProgramCache]: Analyzing trace with hash -164260911, now seen corresponding path program 150 times [2020-02-10 20:42:06,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:06,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814702990] [2020-02-10 20:42:06,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:06,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814702990] [2020-02-10 20:42:06,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:06,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:06,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782860101] [2020-02-10 20:42:06,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:06,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:06,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:06,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:06,477 INFO L87 Difference]: Start difference. First operand 792 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:42:06,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:06,652 INFO L93 Difference]: Finished difference Result 1408 states and 4945 transitions. [2020-02-10 20:42:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:06,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:06,657 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 20:42:06,657 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:42:06,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-02-10 20:42:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:42:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 786. [2020-02-10 20:42:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:42:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3152 transitions. [2020-02-10 20:42:06,696 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3152 transitions. Word has length 25 [2020-02-10 20:42:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:06,696 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3152 transitions. [2020-02-10 20:42:06,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3152 transitions. [2020-02-10 20:42:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:06,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:06,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-02-10 20:42:06,697 INFO L427 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-02-10 20:42:06,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:06,698 INFO L82 PathProgramCache]: Analyzing trace with hash -56568551, now seen corresponding path program 151 times [2020-02-10 20:42:06,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:06,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080405735] [2020-02-10 20:42:06,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:07,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080405735] [2020-02-10 20:42:07,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:07,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:07,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727908933] [2020-02-10 20:42:07,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:07,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:07,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:07,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:07,104 INFO L87 Difference]: Start difference. First operand 786 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:42:07,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:07,280 INFO L93 Difference]: Finished difference Result 1425 states and 4992 transitions. [2020-02-10 20:42:07,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:07,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:07,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:07,284 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 20:42:07,284 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:42:07,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:42:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-02-10 20:42:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:42:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3177 transitions. [2020-02-10 20:42:07,308 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3177 transitions. Word has length 25 [2020-02-10 20:42:07,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:07,309 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3177 transitions. [2020-02-10 20:42:07,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:07,309 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3177 transitions. [2020-02-10 20:42:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:07,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:07,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-02-10 20:42:07,310 INFO L427 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-02-10 20:42:07,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:07,310 INFO L82 PathProgramCache]: Analyzing trace with hash 913683063, now seen corresponding path program 152 times [2020-02-10 20:42:07,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:07,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665570820] [2020-02-10 20:42:07,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:07,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665570820] [2020-02-10 20:42:07,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:07,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:07,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232355743] [2020-02-10 20:42:07,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:07,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:07,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:07,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:07,705 INFO L87 Difference]: Start difference. First operand 795 states and 3177 transitions. Second operand 10 states. [2020-02-10 20:42:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:07,852 INFO L93 Difference]: Finished difference Result 1427 states and 4992 transitions. [2020-02-10 20:42:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:07,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:07,855 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 20:42:07,856 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 20:42:07,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:07,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 20:42:07,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 791. [2020-02-10 20:42:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:42:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3166 transitions. [2020-02-10 20:42:07,880 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3166 transitions. Word has length 25 [2020-02-10 20:42:07,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:07,880 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3166 transitions. [2020-02-10 20:42:07,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:07,880 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3166 transitions. [2020-02-10 20:42:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:07,881 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:07,881 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:07,882 INFO L427 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-02-10 20:42:07,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:07,882 INFO L82 PathProgramCache]: Analyzing trace with hash -942366831, now seen corresponding path program 153 times [2020-02-10 20:42:07,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:07,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748231866] [2020-02-10 20:42:07,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:08,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748231866] [2020-02-10 20:42:08,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:08,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:08,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115814857] [2020-02-10 20:42:08,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:08,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:08,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:08,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:08,282 INFO L87 Difference]: Start difference. First operand 791 states and 3166 transitions. Second operand 10 states. [2020-02-10 20:42:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:08,463 INFO L93 Difference]: Finished difference Result 1429 states and 4995 transitions. [2020-02-10 20:42:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:08,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:08,467 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:42:08,468 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:42:08,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:42:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 796. [2020-02-10 20:42:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:42:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3175 transitions. [2020-02-10 20:42:08,492 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3175 transitions. Word has length 25 [2020-02-10 20:42:08,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:08,492 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3175 transitions. [2020-02-10 20:42:08,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3175 transitions. [2020-02-10 20:42:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:08,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:08,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-02-10 20:42:08,494 INFO L427 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-02-10 20:42:08,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:08,494 INFO L82 PathProgramCache]: Analyzing trace with hash 69897199, now seen corresponding path program 154 times [2020-02-10 20:42:08,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:08,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968171171] [2020-02-10 20:42:08,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:08,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968171171] [2020-02-10 20:42:08,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:08,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:08,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311077733] [2020-02-10 20:42:08,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:08,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:08,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:08,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:08,923 INFO L87 Difference]: Start difference. First operand 796 states and 3175 transitions. Second operand 10 states. [2020-02-10 20:42:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:09,036 INFO L93 Difference]: Finished difference Result 1434 states and 5000 transitions. [2020-02-10 20:42:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:09,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:09,041 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:42:09,041 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 20:42:09,041 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 20:42:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 791. [2020-02-10 20:42:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:42:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3161 transitions. [2020-02-10 20:42:09,065 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3161 transitions. Word has length 25 [2020-02-10 20:42:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:09,065 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3161 transitions. [2020-02-10 20:42:09,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3161 transitions. [2020-02-10 20:42:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:09,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:09,066 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:09,066 INFO L427 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-02-10 20:42:09,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:09,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2065870375, now seen corresponding path program 155 times [2020-02-10 20:42:09,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:09,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763875581] [2020-02-10 20:42:09,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:09,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:09,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763875581] [2020-02-10 20:42:09,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:09,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:09,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170480840] [2020-02-10 20:42:09,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:09,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:09,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:09,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:09,464 INFO L87 Difference]: Start difference. First operand 791 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:42:09,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:09,603 INFO L93 Difference]: Finished difference Result 1435 states and 5004 transitions. [2020-02-10 20:42:09,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:09,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:09,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:09,606 INFO L225 Difference]: With dead ends: 1435 [2020-02-10 20:42:09,606 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 20:42:09,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 20:42:09,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 798. [2020-02-10 20:42:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:42:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3174 transitions. [2020-02-10 20:42:09,632 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3174 transitions. Word has length 25 [2020-02-10 20:42:09,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:09,632 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3174 transitions. [2020-02-10 20:42:09,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3174 transitions. [2020-02-10 20:42:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:09,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:09,633 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:09,633 INFO L427 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-02-10 20:42:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:09,634 INFO L82 PathProgramCache]: Analyzing trace with hash 82926161, now seen corresponding path program 156 times [2020-02-10 20:42:09,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:09,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690745744] [2020-02-10 20:42:09,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:10,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690745744] [2020-02-10 20:42:10,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:10,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:10,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403080507] [2020-02-10 20:42:10,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:10,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:10,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:10,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:10,058 INFO L87 Difference]: Start difference. First operand 798 states and 3174 transitions. Second operand 10 states. [2020-02-10 20:42:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:10,206 INFO L93 Difference]: Finished difference Result 1438 states and 5003 transitions. [2020-02-10 20:42:10,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:10,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:10,210 INFO L225 Difference]: With dead ends: 1438 [2020-02-10 20:42:10,211 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 20:42:10,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 20:42:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 786. [2020-02-10 20:42:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:42:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3148 transitions. [2020-02-10 20:42:10,235 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3148 transitions. Word has length 25 [2020-02-10 20:42:10,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:10,236 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3148 transitions. [2020-02-10 20:42:10,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3148 transitions. [2020-02-10 20:42:10,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:10,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:10,237 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:10,237 INFO L427 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-02-10 20:42:10,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:10,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1446979801, now seen corresponding path program 157 times [2020-02-10 20:42:10,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:10,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579387905] [2020-02-10 20:42:10,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:10,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579387905] [2020-02-10 20:42:10,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:10,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:10,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782596510] [2020-02-10 20:42:10,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:10,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:10,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:10,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:10,646 INFO L87 Difference]: Start difference. First operand 786 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:42:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:10,783 INFO L93 Difference]: Finished difference Result 1413 states and 4957 transitions. [2020-02-10 20:42:10,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:10,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:10,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:10,787 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 20:42:10,787 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 20:42:10,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-02-10 20:42:10,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 20:42:10,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 793. [2020-02-10 20:42:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:42:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3167 transitions. [2020-02-10 20:42:10,811 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3167 transitions. Word has length 25 [2020-02-10 20:42:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:10,811 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3167 transitions. [2020-02-10 20:42:10,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3167 transitions. [2020-02-10 20:42:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:10,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:10,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-02-10 20:42:10,813 INFO L427 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-02-10 20:42:10,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:10,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1867232777, now seen corresponding path program 158 times [2020-02-10 20:42:10,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:10,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517223189] [2020-02-10 20:42:10,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:11,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517223189] [2020-02-10 20:42:11,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:11,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:11,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586051845] [2020-02-10 20:42:11,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:11,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:11,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:11,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:11,215 INFO L87 Difference]: Start difference. First operand 793 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:42:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:11,370 INFO L93 Difference]: Finished difference Result 1412 states and 4952 transitions. [2020-02-10 20:42:11,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:11,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:11,373 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:42:11,374 INFO L226 Difference]: Without dead ends: 1397 [2020-02-10 20:42:11,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-02-10 20:42:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 790. [2020-02-10 20:42:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:42:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3159 transitions. [2020-02-10 20:42:11,398 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3159 transitions. Word has length 25 [2020-02-10 20:42:11,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:11,398 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3159 transitions. [2020-02-10 20:42:11,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:11,398 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3159 transitions. [2020-02-10 20:42:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:11,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:11,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-02-10 20:42:11,399 INFO L427 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-02-10 20:42:11,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:11,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1364852557, now seen corresponding path program 159 times [2020-02-10 20:42:11,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:11,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398135302] [2020-02-10 20:42:11,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:11,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398135302] [2020-02-10 20:42:11,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:11,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:11,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536142577] [2020-02-10 20:42:11,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:11,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:11,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:11,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:11,828 INFO L87 Difference]: Start difference. First operand 790 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:42:11,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:11,964 INFO L93 Difference]: Finished difference Result 1421 states and 4970 transitions. [2020-02-10 20:42:11,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:11,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:11,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:11,968 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:42:11,968 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 20:42:11,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 20:42:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 795. [2020-02-10 20:42:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:42:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3168 transitions. [2020-02-10 20:42:11,992 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3168 transitions. Word has length 25 [2020-02-10 20:42:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:11,993 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3168 transitions. [2020-02-10 20:42:11,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3168 transitions. [2020-02-10 20:42:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:11,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:11,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-02-10 20:42:11,994 INFO L427 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-02-10 20:42:11,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:11,994 INFO L82 PathProgramCache]: Analyzing trace with hash -352588527, now seen corresponding path program 160 times [2020-02-10 20:42:11,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:11,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534775135] [2020-02-10 20:42:11,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:12,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534775135] [2020-02-10 20:42:12,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:12,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:12,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137147309] [2020-02-10 20:42:12,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:12,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:12,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:12,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:12,409 INFO L87 Difference]: Start difference. First operand 795 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:42:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:12,527 INFO L93 Difference]: Finished difference Result 1426 states and 4975 transitions. [2020-02-10 20:42:12,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:12,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:12,531 INFO L225 Difference]: With dead ends: 1426 [2020-02-10 20:42:12,531 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:42:12,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-02-10 20:42:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:42:12,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-02-10 20:42:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:42:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-02-10 20:42:12,555 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-02-10 20:42:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:12,555 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-02-10 20:42:12,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-02-10 20:42:12,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:12,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:12,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:12,556 INFO L427 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-02-10 20:42:12,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:12,556 INFO L82 PathProgramCache]: Analyzing trace with hash -551818919, now seen corresponding path program 161 times [2020-02-10 20:42:12,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:12,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919202152] [2020-02-10 20:42:12,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:12,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919202152] [2020-02-10 20:42:12,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:12,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:12,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534041168] [2020-02-10 20:42:12,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:12,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:12,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:12,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:12,955 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:42:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:13,090 INFO L93 Difference]: Finished difference Result 1418 states and 4959 transitions. [2020-02-10 20:42:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:13,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:13,096 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:42:13,097 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:42:13,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-02-10 20:42:13,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:42:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 20:42:13,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:42:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-02-10 20:42:13,120 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-02-10 20:42:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:13,121 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-02-10 20:42:13,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:13,121 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-02-10 20:42:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:13,122 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:13,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-02-10 20:42:13,122 INFO L427 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-02-10 20:42:13,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:13,122 INFO L82 PathProgramCache]: Analyzing trace with hash -13963341, now seen corresponding path program 162 times [2020-02-10 20:42:13,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:13,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796951063] [2020-02-10 20:42:13,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:13,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796951063] [2020-02-10 20:42:13,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:13,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:13,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511402255] [2020-02-10 20:42:13,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:13,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:13,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:13,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:13,545 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:42:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:13,683 INFO L93 Difference]: Finished difference Result 1424 states and 4967 transitions. [2020-02-10 20:42:13,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:13,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:13,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:13,687 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 20:42:13,687 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:42:13,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:42:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 786. [2020-02-10 20:42:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:42:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3144 transitions. [2020-02-10 20:42:13,713 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3144 transitions. Word has length 25 [2020-02-10 20:42:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:13,713 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3144 transitions. [2020-02-10 20:42:13,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3144 transitions. [2020-02-10 20:42:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:13,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:13,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-02-10 20:42:13,715 INFO L427 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-02-10 20:42:13,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:13,715 INFO L82 PathProgramCache]: Analyzing trace with hash 347922065, now seen corresponding path program 163 times [2020-02-10 20:42:13,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:13,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140904496] [2020-02-10 20:42:13,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:14,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140904496] [2020-02-10 20:42:14,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:14,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:14,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783085425] [2020-02-10 20:42:14,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:14,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:14,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:14,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:14,117 INFO L87 Difference]: Start difference. First operand 786 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:42:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:14,278 INFO L93 Difference]: Finished difference Result 1421 states and 4971 transitions. [2020-02-10 20:42:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:14,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:14,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:14,282 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:42:14,282 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:42:14,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-02-10 20:42:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:42:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 793. [2020-02-10 20:42:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:42:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3163 transitions. [2020-02-10 20:42:14,306 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3163 transitions. Word has length 25 [2020-02-10 20:42:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:14,307 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3163 transitions. [2020-02-10 20:42:14,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3163 transitions. [2020-02-10 20:42:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:14,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:14,308 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:14,308 INFO L427 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-02-10 20:42:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:14,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1958863023, now seen corresponding path program 164 times [2020-02-10 20:42:14,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:14,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032670943] [2020-02-10 20:42:14,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:14,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032670943] [2020-02-10 20:42:14,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:14,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:14,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162073323] [2020-02-10 20:42:14,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:14,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:14,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:14,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:14,701 INFO L87 Difference]: Start difference. First operand 793 states and 3163 transitions. Second operand 10 states. [2020-02-10 20:42:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:14,837 INFO L93 Difference]: Finished difference Result 1418 states and 4962 transitions. [2020-02-10 20:42:14,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:14,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:14,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:14,841 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:42:14,841 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:42:14,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-02-10 20:42:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:42:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-02-10 20:42:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:42:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-02-10 20:42:14,866 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-02-10 20:42:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:14,866 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-02-10 20:42:14,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-02-10 20:42:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:14,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:14,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-02-10 20:42:14,867 INFO L427 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-02-10 20:42:14,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash -158424201, now seen corresponding path program 165 times [2020-02-10 20:42:14,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:14,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991982497] [2020-02-10 20:42:14,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:15,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991982497] [2020-02-10 20:42:15,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:15,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:15,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765678907] [2020-02-10 20:42:15,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:15,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:15,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:15,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:15,400 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:42:15,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:15,533 INFO L93 Difference]: Finished difference Result 1431 states and 4990 transitions. [2020-02-10 20:42:15,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:15,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:15,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:15,537 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 20:42:15,537 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:42:15,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-02-10 20:42:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:42:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 797. [2020-02-10 20:42:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:42:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-02-10 20:42:15,562 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-02-10 20:42:15,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:15,562 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-02-10 20:42:15,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-02-10 20:42:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:15,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:15,563 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:15,563 INFO L427 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-02-10 20:42:15,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:15,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1990372335, now seen corresponding path program 166 times [2020-02-10 20:42:15,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:15,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401724887] [2020-02-10 20:42:15,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:15,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401724887] [2020-02-10 20:42:15,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:15,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:15,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898444842] [2020-02-10 20:42:15,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:15,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:15,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:15,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:15,971 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:42:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:16,080 INFO L93 Difference]: Finished difference Result 1434 states and 4989 transitions. [2020-02-10 20:42:16,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:16,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:16,084 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:42:16,084 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 20:42:16,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-02-10 20:42:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 20:42:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 790. [2020-02-10 20:42:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:42:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3151 transitions. [2020-02-10 20:42:16,108 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3151 transitions. Word has length 25 [2020-02-10 20:42:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:16,108 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3151 transitions. [2020-02-10 20:42:16,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3151 transitions. [2020-02-10 20:42:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:16,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:16,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-02-10 20:42:16,110 INFO L427 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-02-10 20:42:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:16,110 INFO L82 PathProgramCache]: Analyzing trace with hash -147921097, now seen corresponding path program 167 times [2020-02-10 20:42:16,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:16,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576280014] [2020-02-10 20:42:16,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:16,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576280014] [2020-02-10 20:42:16,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:16,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:16,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115471013] [2020-02-10 20:42:16,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:16,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:16,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:16,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:16,532 INFO L87 Difference]: Start difference. First operand 790 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:42:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:16,669 INFO L93 Difference]: Finished difference Result 1422 states and 4965 transitions. [2020-02-10 20:42:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:16,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:16,673 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:42:16,673 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:42:16,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-02-10 20:42:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:42:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 794. [2020-02-10 20:42:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:42:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3158 transitions. [2020-02-10 20:42:16,698 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3158 transitions. Word has length 25 [2020-02-10 20:42:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:16,699 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3158 transitions. [2020-02-10 20:42:16,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3158 transitions. [2020-02-10 20:42:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:16,700 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:16,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-02-10 20:42:16,700 INFO L427 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-02-10 20:42:16,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:16,700 INFO L82 PathProgramCache]: Analyzing trace with hash 389934481, now seen corresponding path program 168 times [2020-02-10 20:42:16,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:16,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115449811] [2020-02-10 20:42:16,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:17,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115449811] [2020-02-10 20:42:17,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:17,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:17,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738144657] [2020-02-10 20:42:17,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:17,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:17,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:17,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:17,119 INFO L87 Difference]: Start difference. First operand 794 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:42:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:17,224 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-02-10 20:42:17,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:17,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:17,229 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:42:17,229 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:42:17,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:42:17,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 782. [2020-02-10 20:42:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:42:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-02-10 20:42:17,253 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-02-10 20:42:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:17,253 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-02-10 20:42:17,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:17,253 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-02-10 20:42:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:17,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:17,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-02-10 20:42:17,255 INFO L427 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-02-10 20:42:17,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:17,255 INFO L82 PathProgramCache]: Analyzing trace with hash 576247283, now seen corresponding path program 169 times [2020-02-10 20:42:17,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:17,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176690908] [2020-02-10 20:42:17,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:17,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176690908] [2020-02-10 20:42:17,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:17,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:17,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317861369] [2020-02-10 20:42:17,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:17,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:17,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:17,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:17,652 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:42:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:17,783 INFO L93 Difference]: Finished difference Result 1444 states and 5049 transitions. [2020-02-10 20:42:17,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:17,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:17,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:17,787 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 20:42:17,788 INFO L226 Difference]: Without dead ends: 1431 [2020-02-10 20:42:17,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-02-10 20:42:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 797. [2020-02-10 20:42:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:42:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3183 transitions. [2020-02-10 20:42:17,812 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3183 transitions. Word has length 25 [2020-02-10 20:42:17,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:17,813 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3183 transitions. [2020-02-10 20:42:17,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3183 transitions. [2020-02-10 20:42:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:17,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:17,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-02-10 20:42:17,814 INFO L427 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-02-10 20:42:17,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:17,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1546498897, now seen corresponding path program 170 times [2020-02-10 20:42:17,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:17,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51876995] [2020-02-10 20:42:17,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:18,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51876995] [2020-02-10 20:42:18,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:18,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:18,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100902379] [2020-02-10 20:42:18,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:18,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:18,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:18,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:18,210 INFO L87 Difference]: Start difference. First operand 797 states and 3183 transitions. Second operand 10 states. [2020-02-10 20:42:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:18,372 INFO L93 Difference]: Finished difference Result 1446 states and 5049 transitions. [2020-02-10 20:42:18,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:18,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:18,377 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 20:42:18,377 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 20:42:18,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 20:42:18,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 793. [2020-02-10 20:42:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:42:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3172 transitions. [2020-02-10 20:42:18,401 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3172 transitions. Word has length 25 [2020-02-10 20:42:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:18,401 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3172 transitions. [2020-02-10 20:42:18,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3172 transitions. [2020-02-10 20:42:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:18,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42: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-02-10 20:42:18,403 INFO L427 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-02-10 20:42:18,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:18,403 INFO L82 PathProgramCache]: Analyzing trace with hash 133348143, now seen corresponding path program 171 times [2020-02-10 20:42:18,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:18,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514715755] [2020-02-10 20:42:18,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42: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-02-10 20:42:18,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514715755] [2020-02-10 20:42:18,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:18,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:18,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395832172] [2020-02-10 20:42:18,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:18,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:18,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:18,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:18,803 INFO L87 Difference]: Start difference. First operand 793 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:42:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:18,942 INFO L93 Difference]: Finished difference Result 1445 states and 5047 transitions. [2020-02-10 20:42:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:18,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:18,946 INFO L225 Difference]: With dead ends: 1445 [2020-02-10 20:42:18,946 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:42:18,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:42:18,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 797. [2020-02-10 20:42:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:42:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3179 transitions. [2020-02-10 20:42:18,971 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3179 transitions. Word has length 25 [2020-02-10 20:42:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:18,971 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3179 transitions. [2020-02-10 20:42:18,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3179 transitions. [2020-02-10 20:42:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:18,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:18,972 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:18,972 INFO L427 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-02-10 20:42:18,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:18,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1124605965, now seen corresponding path program 172 times [2020-02-10 20:42:18,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:18,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385318680] [2020-02-10 20:42:18,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:19,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385318680] [2020-02-10 20:42:19,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:19,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:19,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932167303] [2020-02-10 20:42:19,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:19,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:19,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:19,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:19,383 INFO L87 Difference]: Start difference. First operand 797 states and 3179 transitions. Second operand 10 states. [2020-02-10 20:42:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:19,526 INFO L93 Difference]: Finished difference Result 1448 states and 5049 transitions. [2020-02-10 20:42:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:19,526 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:19,530 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 20:42:19,530 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:42:19,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-02-10 20:42:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:42:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 793. [2020-02-10 20:42:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:42:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3168 transitions. [2020-02-10 20:42:19,555 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3168 transitions. Word has length 25 [2020-02-10 20:42:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:19,555 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3168 transitions. [2020-02-10 20:42:19,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3168 transitions. [2020-02-10 20:42:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:19,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:19,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:19,556 INFO L427 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-02-10 20:42:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:19,557 INFO L82 PathProgramCache]: Analyzing trace with hash -2084246989, now seen corresponding path program 173 times [2020-02-10 20:42:19,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:19,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343148495] [2020-02-10 20:42:19,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:19,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-02-10 20:42:19,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343148495] [2020-02-10 20:42:19,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:19,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:19,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80764517] [2020-02-10 20:42:19,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:19,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:19,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:19,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:19,957 INFO L87 Difference]: Start difference. First operand 793 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:42:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:20,082 INFO L93 Difference]: Finished difference Result 1451 states and 5057 transitions. [2020-02-10 20:42:20,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:20,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:20,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:20,086 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 20:42:20,086 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:42:20,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-02-10 20:42:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:42:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 799. [2020-02-10 20:42:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:42:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3179 transitions. [2020-02-10 20:42:20,111 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3179 transitions. Word has length 25 [2020-02-10 20:42:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:20,111 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3179 transitions. [2020-02-10 20:42:20,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:20,111 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3179 transitions. [2020-02-10 20:42:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:20,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:20,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:20,112 INFO L427 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-02-10 20:42:20,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:20,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1137634927, now seen corresponding path program 174 times [2020-02-10 20:42:20,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:20,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167497193] [2020-02-10 20:42:20,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:20,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167497193] [2020-02-10 20:42:20,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:20,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:20,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938749367] [2020-02-10 20:42:20,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:20,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:20,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:20,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:20,552 INFO L87 Difference]: Start difference. First operand 799 states and 3179 transitions. Second operand 10 states. [2020-02-10 20:42:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:20,689 INFO L93 Difference]: Finished difference Result 1452 states and 5053 transitions. [2020-02-10 20:42:20,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:20,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:20,693 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 20:42:20,694 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 20:42:20,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 20:42:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 789. [2020-02-10 20:42:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:42:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3157 transitions. [2020-02-10 20:42:20,718 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3157 transitions. Word has length 25 [2020-02-10 20:42:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:20,718 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3157 transitions. [2020-02-10 20:42:20,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3157 transitions. [2020-02-10 20:42:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:20,720 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:20,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-02-10 20:42:20,720 INFO L427 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-02-10 20:42:20,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:20,720 INFO L82 PathProgramCache]: Analyzing trace with hash -268724169, now seen corresponding path program 175 times [2020-02-10 20:42:20,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:20,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278508863] [2020-02-10 20:42:20,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:21,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278508863] [2020-02-10 20:42:21,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:21,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:21,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111265617] [2020-02-10 20:42:21,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:21,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:21,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:21,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:21,123 INFO L87 Difference]: Start difference. First operand 789 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:42:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:21,270 INFO L93 Difference]: Finished difference Result 1449 states and 5055 transitions. [2020-02-10 20:42:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:21,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:21,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:21,274 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:42:21,274 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:42:21,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:42:21,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 798. [2020-02-10 20:42:21,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:42:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3182 transitions. [2020-02-10 20:42:21,298 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3182 transitions. Word has length 25 [2020-02-10 20:42:21,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:21,299 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3182 transitions. [2020-02-10 20:42:21,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3182 transitions. [2020-02-10 20:42:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:21,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:21,300 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:21,300 INFO L427 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-02-10 20:42:21,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:21,300 INFO L82 PathProgramCache]: Analyzing trace with hash 701527445, now seen corresponding path program 176 times [2020-02-10 20:42:21,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:21,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377599388] [2020-02-10 20:42:21,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:21,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377599388] [2020-02-10 20:42:21,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:21,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:21,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949041749] [2020-02-10 20:42:21,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:21,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:21,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:21,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:21,701 INFO L87 Difference]: Start difference. First operand 798 states and 3182 transitions. Second operand 10 states. [2020-02-10 20:42:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:21,844 INFO L93 Difference]: Finished difference Result 1451 states and 5055 transitions. [2020-02-10 20:42:21,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:21,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:21,849 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 20:42:21,849 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:42:21,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-02-10 20:42:21,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:42:21,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 794. [2020-02-10 20:42:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:42:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3171 transitions. [2020-02-10 20:42:21,873 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3171 transitions. Word has length 25 [2020-02-10 20:42:21,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:21,873 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3171 transitions. [2020-02-10 20:42:21,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3171 transitions. [2020-02-10 20:42:21,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:21,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:21,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-02-10 20:42:21,875 INFO L427 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-02-10 20:42:21,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:21,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1154522449, now seen corresponding path program 177 times [2020-02-10 20:42:21,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:21,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541603713] [2020-02-10 20:42:21,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:22,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541603713] [2020-02-10 20:42:22,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:22,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:22,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171352753] [2020-02-10 20:42:22,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:22,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:22,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:22,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:22,298 INFO L87 Difference]: Start difference. First operand 794 states and 3171 transitions. Second operand 10 states. [2020-02-10 20:42:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:22,435 INFO L93 Difference]: Finished difference Result 1453 states and 5058 transitions. [2020-02-10 20:42:22,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:22,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:22,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:22,440 INFO L225 Difference]: With dead ends: 1453 [2020-02-10 20:42:22,440 INFO L226 Difference]: Without dead ends: 1440 [2020-02-10 20:42:22,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-02-10 20:42:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-02-10 20:42:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 799. [2020-02-10 20:42:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:42:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3180 transitions. [2020-02-10 20:42:22,466 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3180 transitions. Word has length 25 [2020-02-10 20:42:22,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:22,466 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3180 transitions. [2020-02-10 20:42:22,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3180 transitions. [2020-02-10 20:42:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:22,468 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:22,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-02-10 20:42:22,468 INFO L427 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-02-10 20:42:22,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:22,468 INFO L82 PathProgramCache]: Analyzing trace with hash -142258419, now seen corresponding path program 178 times [2020-02-10 20:42:22,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:22,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548395317] [2020-02-10 20:42:22,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:22,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548395317] [2020-02-10 20:42:22,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:22,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:22,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113974774] [2020-02-10 20:42:22,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:22,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:22,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:22,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:22,885 INFO L87 Difference]: Start difference. First operand 799 states and 3180 transitions. Second operand 10 states. [2020-02-10 20:42:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:23,003 INFO L93 Difference]: Finished difference Result 1458 states and 5063 transitions. [2020-02-10 20:42:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:23,003 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:23,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:23,007 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 20:42:23,007 INFO L226 Difference]: Without dead ends: 1435 [2020-02-10 20:42:23,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-02-10 20:42:23,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 794. [2020-02-10 20:42:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:42:23,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3166 transitions. [2020-02-10 20:42:23,032 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3166 transitions. Word has length 25 [2020-02-10 20:42:23,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:23,032 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3166 transitions. [2020-02-10 20:42:23,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:23,032 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3166 transitions. [2020-02-10 20:42:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:23,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:23,033 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:23,033 INFO L427 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-02-10 20:42:23,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:23,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2016941303, now seen corresponding path program 179 times [2020-02-10 20:42:23,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:23,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165640793] [2020-02-10 20:42:23,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:23,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165640793] [2020-02-10 20:42:23,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:23,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:23,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965615787] [2020-02-10 20:42:23,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:23,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:23,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:23,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:23,436 INFO L87 Difference]: Start difference. First operand 794 states and 3166 transitions. Second operand 10 states. [2020-02-10 20:42:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:23,617 INFO L93 Difference]: Finished difference Result 1459 states and 5067 transitions. [2020-02-10 20:42:23,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:23,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:23,621 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 20:42:23,621 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:42:23,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-02-10 20:42:23,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:42:23,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 801. [2020-02-10 20:42:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:42:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3179 transitions. [2020-02-10 20:42:23,645 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3179 transitions. Word has length 25 [2020-02-10 20:42:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:23,646 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3179 transitions. [2020-02-10 20:42:23,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3179 transitions. [2020-02-10 20:42:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:23,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:23,647 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:23,647 INFO L427 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-02-10 20:42:23,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:23,647 INFO L82 PathProgramCache]: Analyzing trace with hash -129229457, now seen corresponding path program 180 times [2020-02-10 20:42:23,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:23,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493956328] [2020-02-10 20:42:23,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:24,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493956328] [2020-02-10 20:42:24,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:24,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:24,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227267566] [2020-02-10 20:42:24,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:24,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:24,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:24,068 INFO L87 Difference]: Start difference. First operand 801 states and 3179 transitions. Second operand 10 states. [2020-02-10 20:42:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:24,209 INFO L93 Difference]: Finished difference Result 1462 states and 5066 transitions. [2020-02-10 20:42:24,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:24,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:24,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:24,213 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 20:42:24,213 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:42:24,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:42:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 789. [2020-02-10 20:42:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:42:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3152 transitions. [2020-02-10 20:42:24,238 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3152 transitions. Word has length 25 [2020-02-10 20:42:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:24,238 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3152 transitions. [2020-02-10 20:42:24,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3152 transitions. [2020-02-10 20:42:24,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:24,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:24,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-02-10 20:42:24,239 INFO L427 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-02-10 20:42:24,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:24,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1556594761, now seen corresponding path program 181 times [2020-02-10 20:42:24,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:24,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113813959] [2020-02-10 20:42:24,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:24,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113813959] [2020-02-10 20:42:24,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:24,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:24,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129403125] [2020-02-10 20:42:24,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:24,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:24,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:24,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:24,651 INFO L87 Difference]: Start difference. First operand 789 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:42:24,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:24,796 INFO L93 Difference]: Finished difference Result 1454 states and 5060 transitions. [2020-02-10 20:42:24,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:24,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:24,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:24,800 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 20:42:24,801 INFO L226 Difference]: Without dead ends: 1441 [2020-02-10 20:42:24,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2020-02-10 20:42:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 799. [2020-02-10 20:42:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:42:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3179 transitions. [2020-02-10 20:42:24,825 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3179 transitions. Word has length 25 [2020-02-10 20:42:24,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:24,826 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3179 transitions. [2020-02-10 20:42:24,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:24,826 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3179 transitions. [2020-02-10 20:42:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:24,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:24,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-02-10 20:42:24,827 INFO L427 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-02-10 20:42:24,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:24,827 INFO L82 PathProgramCache]: Analyzing trace with hash -565336939, now seen corresponding path program 182 times [2020-02-10 20:42:24,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:24,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513066967] [2020-02-10 20:42:24,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:25,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-02-10 20:42:25,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513066967] [2020-02-10 20:42:25,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:25,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:25,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868582618] [2020-02-10 20:42:25,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:25,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:25,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:25,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:25,232 INFO L87 Difference]: Start difference. First operand 799 states and 3179 transitions. Second operand 10 states. [2020-02-10 20:42:25,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:25,376 INFO L93 Difference]: Finished difference Result 1457 states and 5062 transitions. [2020-02-10 20:42:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:25,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:25,381 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:42:25,381 INFO L226 Difference]: Without dead ends: 1437 [2020-02-10 20:42:25,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:25,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-02-10 20:42:25,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 795. [2020-02-10 20:42:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:42:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3168 transitions. [2020-02-10 20:42:25,406 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3168 transitions. Word has length 25 [2020-02-10 20:42:25,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:25,406 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3168 transitions. [2020-02-10 20:42:25,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3168 transitions. [2020-02-10 20:42:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:25,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:25,408 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:25,408 INFO L427 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-02-10 20:42:25,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:25,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1999493901, now seen corresponding path program 183 times [2020-02-10 20:42:25,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:25,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707454731] [2020-02-10 20:42:25,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42: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-02-10 20:42:25,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707454731] [2020-02-10 20:42:25,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:25,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:25,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642961852] [2020-02-10 20:42:25,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:25,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:25,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:25,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:25,820 INFO L87 Difference]: Start difference. First operand 795 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:42:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:25,961 INFO L93 Difference]: Finished difference Result 1457 states and 5061 transitions. [2020-02-10 20:42:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:25,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:25,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:25,966 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:42:25,966 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:42:25,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:42:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 800. [2020-02-10 20:42:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:42:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3177 transitions. [2020-02-10 20:42:25,990 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3177 transitions. Word has length 25 [2020-02-10 20:42:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:25,990 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3177 transitions. [2020-02-10 20:42:25,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3177 transitions. [2020-02-10 20:42:25,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:25,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:25,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:25,992 INFO L427 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-02-10 20:42:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:25,992 INFO L82 PathProgramCache]: Analyzing trace with hash -987229871, now seen corresponding path program 184 times [2020-02-10 20:42:25,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:25,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641910818] [2020-02-10 20:42:25,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:26,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-02-10 20:42:26,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641910818] [2020-02-10 20:42:26,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:26,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:26,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019289281] [2020-02-10 20:42:26,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:26,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:26,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:26,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:26,441 INFO L87 Difference]: Start difference. First operand 800 states and 3177 transitions. Second operand 10 states. [2020-02-10 20:42:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:26,558 INFO L93 Difference]: Finished difference Result 1462 states and 5066 transitions. [2020-02-10 20:42:26,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:26,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:26,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:26,562 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 20:42:26,563 INFO L226 Difference]: Without dead ends: 1439 [2020-02-10 20:42:26,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:26,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-02-10 20:42:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 795. [2020-02-10 20:42:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:42:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3163 transitions. [2020-02-10 20:42:26,586 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3163 transitions. Word has length 25 [2020-02-10 20:42:26,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:26,587 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3163 transitions. [2020-02-10 20:42:26,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3163 transitions. [2020-02-10 20:42:26,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:26,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:26,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-02-10 20:42:26,588 INFO L427 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-02-10 20:42:26,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:26,588 INFO L82 PathProgramCache]: Analyzing trace with hash 750076919, now seen corresponding path program 185 times [2020-02-10 20:42:26,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:26,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062604081] [2020-02-10 20:42:26,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:27,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062604081] [2020-02-10 20:42:27,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:27,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:27,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567380138] [2020-02-10 20:42:27,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:27,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:27,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:27,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:27,014 INFO L87 Difference]: Start difference. First operand 795 states and 3163 transitions. Second operand 10 states. [2020-02-10 20:42:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:27,158 INFO L93 Difference]: Finished difference Result 1467 states and 5078 transitions. [2020-02-10 20:42:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:27,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:27,162 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 20:42:27,163 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 20:42:27,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-02-10 20:42:27,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 20:42:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 804. [2020-02-10 20:42:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:42:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3179 transitions. [2020-02-10 20:42:27,188 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3179 transitions. Word has length 25 [2020-02-10 20:42:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:27,189 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3179 transitions. [2020-02-10 20:42:27,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3179 transitions. [2020-02-10 20:42:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:27,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:27,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-02-10 20:42:27,191 INFO L427 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-02-10 20:42:27,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:27,191 INFO L82 PathProgramCache]: Analyzing trace with hash -323008461, now seen corresponding path program 186 times [2020-02-10 20:42:27,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:27,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829294132] [2020-02-10 20:42:27,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:27,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829294132] [2020-02-10 20:42:27,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:27,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:27,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738610042] [2020-02-10 20:42:27,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:27,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:27,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:27,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:27,625 INFO L87 Difference]: Start difference. First operand 804 states and 3179 transitions. Second operand 10 states. [2020-02-10 20:42:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:27,746 INFO L93 Difference]: Finished difference Result 1469 states and 5074 transitions. [2020-02-10 20:42:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:27,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:27,750 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 20:42:27,750 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:42:27,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:42:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 789. [2020-02-10 20:42:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:42:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3146 transitions. [2020-02-10 20:42:27,774 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3146 transitions. Word has length 25 [2020-02-10 20:42:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:27,775 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3146 transitions. [2020-02-10 20:42:27,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3146 transitions. [2020-02-10 20:42:27,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:27,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:27,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-02-10 20:42:27,776 INFO L427 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-02-10 20:42:27,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:27,776 INFO L82 PathProgramCache]: Analyzing trace with hash 38876945, now seen corresponding path program 187 times [2020-02-10 20:42:27,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:27,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029515992] [2020-02-10 20:42:27,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:28,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029515992] [2020-02-10 20:42:28,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:28,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:28,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829371530] [2020-02-10 20:42:28,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:28,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:28,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:28,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:28,188 INFO L87 Difference]: Start difference. First operand 789 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:42:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:28,348 INFO L93 Difference]: Finished difference Result 1469 states and 5093 transitions. [2020-02-10 20:42:28,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:28,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:28,352 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 20:42:28,353 INFO L226 Difference]: Without dead ends: 1454 [2020-02-10 20:42:28,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-02-10 20:42:28,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 804. [2020-02-10 20:42:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:42:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3186 transitions. [2020-02-10 20:42:28,378 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3186 transitions. Word has length 25 [2020-02-10 20:42:28,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:28,378 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3186 transitions. [2020-02-10 20:42:28,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3186 transitions. [2020-02-10 20:42:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:28,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:28,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-02-10 20:42:28,379 INFO L427 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-02-10 20:42:28,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:28,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1034208435, now seen corresponding path program 188 times [2020-02-10 20:42:28,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:28,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565574273] [2020-02-10 20:42:28,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:28,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565574273] [2020-02-10 20:42:28,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:28,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:28,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185255702] [2020-02-10 20:42:28,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:28,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:28,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:28,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:28,790 INFO L87 Difference]: Start difference. First operand 804 states and 3186 transitions. Second operand 10 states. [2020-02-10 20:42:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:28,969 INFO L93 Difference]: Finished difference Result 1470 states and 5089 transitions. [2020-02-10 20:42:28,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:28,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:28,973 INFO L225 Difference]: With dead ends: 1470 [2020-02-10 20:42:28,973 INFO L226 Difference]: Without dead ends: 1448 [2020-02-10 20:42:28,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-02-10 20:42:28,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 798. [2020-02-10 20:42:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:42:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3169 transitions. [2020-02-10 20:42:29,001 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3169 transitions. Word has length 25 [2020-02-10 20:42:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:29,001 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3169 transitions. [2020-02-10 20:42:29,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3169 transitions. [2020-02-10 20:42:29,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:29,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:29,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-02-10 20:42:29,003 INFO L427 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-02-10 20:42:29,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:29,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1132968533, now seen corresponding path program 189 times [2020-02-10 20:42:29,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:29,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78941171] [2020-02-10 20:42:29,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42: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-02-10 20:42:29,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78941171] [2020-02-10 20:42:29,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:29,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:29,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759504037] [2020-02-10 20:42:29,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:29,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:29,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:29,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:29,435 INFO L87 Difference]: Start difference. First operand 798 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:42:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:29,577 INFO L93 Difference]: Finished difference Result 1472 states and 5092 transitions. [2020-02-10 20:42:29,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:29,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:29,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:29,581 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 20:42:29,582 INFO L226 Difference]: Without dead ends: 1457 [2020-02-10 20:42:29,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:29,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-02-10 20:42:29,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 805. [2020-02-10 20:42:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 20:42:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3182 transitions. [2020-02-10 20:42:29,606 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3182 transitions. Word has length 25 [2020-02-10 20:42:29,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:29,606 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3182 transitions. [2020-02-10 20:42:29,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3182 transitions. [2020-02-10 20:42:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:29,607 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:29,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-02-10 20:42:29,607 INFO L427 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-02-10 20:42:29,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:29,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1013202227, now seen corresponding path program 190 times [2020-02-10 20:42:29,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:29,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090046308] [2020-02-10 20:42:29,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:30,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090046308] [2020-02-10 20:42:30,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:30,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:30,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728450171] [2020-02-10 20:42:30,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:30,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:30,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:30,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:30,054 INFO L87 Difference]: Start difference. First operand 805 states and 3182 transitions. Second operand 10 states. [2020-02-10 20:42:30,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:30,169 INFO L93 Difference]: Finished difference Result 1475 states and 5091 transitions. [2020-02-10 20:42:30,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:30,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:30,173 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 20:42:30,174 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 20:42:30,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 20:42:30,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 798. [2020-02-10 20:42:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:42:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3162 transitions. [2020-02-10 20:42:30,198 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3162 transitions. Word has length 25 [2020-02-10 20:42:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:30,198 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3162 transitions. [2020-02-10 20:42:30,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3162 transitions. [2020-02-10 20:42:30,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:30,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:30,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-02-10 20:42:30,199 INFO L427 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-02-10 20:42:30,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:30,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1153974741, now seen corresponding path program 191 times [2020-02-10 20:42:30,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:30,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566533944] [2020-02-10 20:42:30,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:30,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566533944] [2020-02-10 20:42:30,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:30,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:30,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011604559] [2020-02-10 20:42:30,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:30,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:30,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:30,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:30,626 INFO L87 Difference]: Start difference. First operand 798 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:42:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:30,764 INFO L93 Difference]: Finished difference Result 1476 states and 5093 transitions. [2020-02-10 20:42:30,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:30,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:30,768 INFO L225 Difference]: With dead ends: 1476 [2020-02-10 20:42:30,768 INFO L226 Difference]: Without dead ends: 1460 [2020-02-10 20:42:30,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-02-10 20:42:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-02-10 20:42:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 807. [2020-02-10 20:42:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:42:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3178 transitions. [2020-02-10 20:42:30,794 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3178 transitions. Word has length 25 [2020-02-10 20:42:30,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:30,794 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3178 transitions. [2020-02-10 20:42:30,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3178 transitions. [2020-02-10 20:42:30,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:30,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:30,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-02-10 20:42:30,795 INFO L427 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-02-10 20:42:30,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:30,796 INFO L82 PathProgramCache]: Analyzing trace with hash 80889361, now seen corresponding path program 192 times [2020-02-10 20:42:30,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:30,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403199221] [2020-02-10 20:42:30,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:31,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403199221] [2020-02-10 20:42:31,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:31,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:31,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520421737] [2020-02-10 20:42:31,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:31,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:31,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:31,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:31,237 INFO L87 Difference]: Start difference. First operand 807 states and 3178 transitions. Second operand 10 states. [2020-02-10 20:42:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:31,353 INFO L93 Difference]: Finished difference Result 1478 states and 5089 transitions. [2020-02-10 20:42:31,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:31,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:31,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:31,357 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 20:42:31,357 INFO L226 Difference]: Without dead ends: 1435 [2020-02-10 20:42:31,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-02-10 20:42:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-02-10 20:42:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 782. [2020-02-10 20:42:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:42:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-02-10 20:42:31,381 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-02-10 20:42:31,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:31,381 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-02-10 20:42:31,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-02-10 20:42:31,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:31,383 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:31,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-02-10 20:42:31,383 INFO L427 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-02-10 20:42:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:31,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1867640017, now seen corresponding path program 193 times [2020-02-10 20:42:31,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:31,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95604449] [2020-02-10 20:42:31,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:31,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95604449] [2020-02-10 20:42:31,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:31,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:31,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430492556] [2020-02-10 20:42:31,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:31,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:31,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:31,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:31,785 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:42:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:31,940 INFO L93 Difference]: Finished difference Result 1414 states and 4957 transitions. [2020-02-10 20:42:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:31,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:31,944 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:42:31,944 INFO L226 Difference]: Without dead ends: 1401 [2020-02-10 20:42:31,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-02-10 20:42:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-02-10 20:42:31,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 793. [2020-02-10 20:42:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:42:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3164 transitions. [2020-02-10 20:42:31,968 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3164 transitions. Word has length 25 [2020-02-10 20:42:31,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:31,969 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3164 transitions. [2020-02-10 20:42:31,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3164 transitions. [2020-02-10 20:42:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:31,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:31,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-02-10 20:42:31,970 INFO L427 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-02-10 20:42:31,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:31,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1446572561, now seen corresponding path program 194 times [2020-02-10 20:42:31,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:31,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938696905] [2020-02-10 20:42:31,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:32,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-02-10 20:42:32,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938696905] [2020-02-10 20:42:32,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:32,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:32,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527276816] [2020-02-10 20:42:32,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:32,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:32,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:32,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:32,372 INFO L87 Difference]: Start difference. First operand 793 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:42:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:32,512 INFO L93 Difference]: Finished difference Result 1413 states and 4952 transitions. [2020-02-10 20:42:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:32,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:32,516 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 20:42:32,517 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:42:32,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-02-10 20:42:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:42:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 790. [2020-02-10 20:42:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:42:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3156 transitions. [2020-02-10 20:42:32,541 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3156 transitions. Word has length 25 [2020-02-10 20:42:32,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:32,541 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3156 transitions. [2020-02-10 20:42:32,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3156 transitions. [2020-02-10 20:42:32,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:32,542 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:32,542 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:32,542 INFO L427 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-02-10 20:42:32,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:32,542 INFO L82 PathProgramCache]: Analyzing trace with hash -501293201, now seen corresponding path program 195 times [2020-02-10 20:42:32,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:32,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691812119] [2020-02-10 20:42:32,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:32,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:32,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691812119] [2020-02-10 20:42:32,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:32,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:32,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393751419] [2020-02-10 20:42:32,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:32,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:32,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:32,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:32,946 INFO L87 Difference]: Start difference. First operand 790 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:42:33,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:33,087 INFO L93 Difference]: Finished difference Result 1419 states and 4965 transitions. [2020-02-10 20:42:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:33,088 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:33,091 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:42:33,091 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:42:33,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:42:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 20:42:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:42:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3163 transitions. [2020-02-10 20:42:33,116 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3163 transitions. Word has length 25 [2020-02-10 20:42:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:33,116 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3163 transitions. [2020-02-10 20:42:33,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3163 transitions. [2020-02-10 20:42:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:33,117 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:33,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:33,118 INFO L427 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-02-10 20:42:33,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:33,118 INFO L82 PathProgramCache]: Analyzing trace with hash 489964621, now seen corresponding path program 196 times [2020-02-10 20:42:33,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:33,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122017105] [2020-02-10 20:42:33,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:33,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122017105] [2020-02-10 20:42:33,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:33,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:33,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094023083] [2020-02-10 20:42:33,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:33,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:33,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:33,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:33,523 INFO L87 Difference]: Start difference. First operand 794 states and 3163 transitions. Second operand 10 states. [2020-02-10 20:42:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:33,685 INFO L93 Difference]: Finished difference Result 1422 states and 4967 transitions. [2020-02-10 20:42:33,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:33,686 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:33,689 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:42:33,689 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:42:33,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-02-10 20:42:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:42:33,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-02-10 20:42:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:42:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3153 transitions. [2020-02-10 20:42:33,713 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3153 transitions. Word has length 25 [2020-02-10 20:42:33,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:33,713 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3153 transitions. [2020-02-10 20:42:33,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3153 transitions. [2020-02-10 20:42:33,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:33,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:33,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-02-10 20:42:33,715 INFO L427 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-02-10 20:42:33,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:33,715 INFO L82 PathProgramCache]: Analyzing trace with hash -782351151, now seen corresponding path program 197 times [2020-02-10 20:42:33,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:33,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913654118] [2020-02-10 20:42:33,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:34,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913654118] [2020-02-10 20:42:34,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:34,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:34,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018039800] [2020-02-10 20:42:34,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:34,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:34,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:34,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:34,119 INFO L87 Difference]: Start difference. First operand 790 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:42:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:34,263 INFO L93 Difference]: Finished difference Result 1416 states and 4955 transitions. [2020-02-10 20:42:34,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:34,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:34,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:34,268 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:42:34,268 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 20:42:34,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:34,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 20:42:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 793. [2020-02-10 20:42:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:42:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3158 transitions. [2020-02-10 20:42:34,292 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3158 transitions. Word has length 25 [2020-02-10 20:42:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:34,292 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3158 transitions. [2020-02-10 20:42:34,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3158 transitions. [2020-02-10 20:42:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:34,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:34,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-02-10 20:42:34,293 INFO L427 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-02-10 20:42:34,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:34,294 INFO L82 PathProgramCache]: Analyzing trace with hash 828589807, now seen corresponding path program 198 times [2020-02-10 20:42:34,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:34,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493797905] [2020-02-10 20:42:34,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:34,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-02-10 20:42:34,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493797905] [2020-02-10 20:42:34,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:34,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:34,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297119572] [2020-02-10 20:42:34,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:34,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:34,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:34,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:34,711 INFO L87 Difference]: Start difference. First operand 793 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:42:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:34,856 INFO L93 Difference]: Finished difference Result 1420 states and 4960 transitions. [2020-02-10 20:42:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:34,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:34,860 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 20:42:34,861 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:42:34,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-02-10 20:42:34,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:42:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 787. [2020-02-10 20:42:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:42:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3145 transitions. [2020-02-10 20:42:34,885 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3145 transitions. Word has length 25 [2020-02-10 20:42:34,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:34,885 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3145 transitions. [2020-02-10 20:42:34,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:34,885 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3145 transitions. [2020-02-10 20:42:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:34,886 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:34,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-02-10 20:42:34,886 INFO L427 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-02-10 20:42:34,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:34,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1022668565, now seen corresponding path program 199 times [2020-02-10 20:42:34,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:34,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651898547] [2020-02-10 20:42:34,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:35,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651898547] [2020-02-10 20:42:35,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:35,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:35,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552237235] [2020-02-10 20:42:35,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:35,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:35,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:35,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:35,298 INFO L87 Difference]: Start difference. First operand 787 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:42:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:35,444 INFO L93 Difference]: Finished difference Result 1419 states and 4964 transitions. [2020-02-10 20:42:35,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:35,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:35,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:35,448 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:42:35,448 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:42:35,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:42:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 20:42:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:42:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-02-10 20:42:35,472 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-02-10 20:42:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:35,472 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-02-10 20:42:35,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-02-10 20:42:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:35,473 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:35,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-02-10 20:42:35,473 INFO L427 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-02-10 20:42:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2003423283, now seen corresponding path program 200 times [2020-02-10 20:42:35,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:35,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942037743] [2020-02-10 20:42:35,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:35,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-02-10 20:42:35,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942037743] [2020-02-10 20:42:35,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:35,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:35,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366733391] [2020-02-10 20:42:35,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:35,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:35,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:35,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:35,905 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:42:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:36,044 INFO L93 Difference]: Finished difference Result 1418 states and 4959 transitions. [2020-02-10 20:42:36,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:36,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:36,048 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:42:36,049 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:42:36,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:42:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 791. [2020-02-10 20:42:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:42:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3156 transitions. [2020-02-10 20:42:36,073 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3156 transitions. Word has length 25 [2020-02-10 20:42:36,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:36,073 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3156 transitions. [2020-02-10 20:42:36,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3156 transitions. [2020-02-10 20:42:36,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:36,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:36,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-02-10 20:42:36,075 INFO L427 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-02-10 20:42:36,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:36,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1789163793, now seen corresponding path program 201 times [2020-02-10 20:42:36,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:36,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308820533] [2020-02-10 20:42:36,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:36,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308820533] [2020-02-10 20:42:36,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:36,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:36,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142282832] [2020-02-10 20:42:36,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:36,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:36,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:36,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:36,477 INFO L87 Difference]: Start difference. First operand 791 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:42:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:36,615 INFO L93 Difference]: Finished difference Result 1427 states and 4977 transitions. [2020-02-10 20:42:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:36,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:36,619 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 20:42:36,619 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 20:42:36,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-02-10 20:42:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 20:42:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 796. [2020-02-10 20:42:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:42:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3165 transitions. [2020-02-10 20:42:36,644 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3165 transitions. Word has length 25 [2020-02-10 20:42:36,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:36,644 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3165 transitions. [2020-02-10 20:42:36,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3165 transitions. [2020-02-10 20:42:36,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:36,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:36,645 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:36,645 INFO L427 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-02-10 20:42:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash -776899763, now seen corresponding path program 202 times [2020-02-10 20:42:36,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:36,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024610237] [2020-02-10 20:42:36,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:37,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024610237] [2020-02-10 20:42:37,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:37,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:37,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529927495] [2020-02-10 20:42:37,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:37,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:37,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:37,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:37,063 INFO L87 Difference]: Start difference. First operand 796 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:42:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:37,204 INFO L93 Difference]: Finished difference Result 1432 states and 4982 transitions. [2020-02-10 20:42:37,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:37,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:37,207 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:42:37,207 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 20:42:37,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:37,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 20:42:37,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 791. [2020-02-10 20:42:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:42:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3152 transitions. [2020-02-10 20:42:37,231 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3152 transitions. Word has length 25 [2020-02-10 20:42:37,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:37,231 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3152 transitions. [2020-02-10 20:42:37,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3152 transitions. [2020-02-10 20:42:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:37,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:37,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-02-10 20:42:37,233 INFO L427 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-02-10 20:42:37,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:37,233 INFO L82 PathProgramCache]: Analyzing trace with hash -976130155, now seen corresponding path program 203 times [2020-02-10 20:42:37,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:37,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292577747] [2020-02-10 20:42:37,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:37,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292577747] [2020-02-10 20:42:37,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:37,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:37,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098153771] [2020-02-10 20:42:37,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:37,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:37,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:37,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:37,639 INFO L87 Difference]: Start difference. First operand 791 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:42:37,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:37,816 INFO L93 Difference]: Finished difference Result 1424 states and 4966 transitions. [2020-02-10 20:42:37,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:37,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:37,820 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 20:42:37,820 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:42:37,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:37,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:42:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-02-10 20:42:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:42:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3159 transitions. [2020-02-10 20:42:37,848 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3159 transitions. Word has length 25 [2020-02-10 20:42:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:37,848 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3159 transitions. [2020-02-10 20:42:37,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3159 transitions. [2020-02-10 20:42:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:37,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:37,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-02-10 20:42:37,849 INFO L427 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-02-10 20:42:37,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:37,849 INFO L82 PathProgramCache]: Analyzing trace with hash -438274577, now seen corresponding path program 204 times [2020-02-10 20:42:37,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:37,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054238157] [2020-02-10 20:42:37,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:38,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054238157] [2020-02-10 20:42:38,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:38,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:38,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934437542] [2020-02-10 20:42:38,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:38,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:38,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:38,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:38,262 INFO L87 Difference]: Start difference. First operand 795 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:42:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:38,386 INFO L93 Difference]: Finished difference Result 1430 states and 4974 transitions. [2020-02-10 20:42:38,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:38,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:38,390 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 20:42:38,391 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 20:42:38,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-02-10 20:42:38,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 20:42:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 787. [2020-02-10 20:42:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:42:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-02-10 20:42:38,415 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-02-10 20:42:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:38,415 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-02-10 20:42:38,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-02-10 20:42:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:38,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:38,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-02-10 20:42:38,416 INFO L427 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-02-10 20:42:38,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:38,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1768750379, now seen corresponding path program 205 times [2020-02-10 20:42:38,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:38,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531670720] [2020-02-10 20:42:38,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:38,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531670720] [2020-02-10 20:42:38,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:38,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:38,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978073941] [2020-02-10 20:42:38,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:38,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:38,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:38,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:38,832 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:42:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:38,976 INFO L93 Difference]: Finished difference Result 1436 states and 5001 transitions. [2020-02-10 20:42:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:38,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:38,980 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 20:42:38,981 INFO L226 Difference]: Without dead ends: 1423 [2020-02-10 20:42:38,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:38,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-02-10 20:42:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 797. [2020-02-10 20:42:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:42:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-02-10 20:42:39,005 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-02-10 20:42:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:39,005 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-02-10 20:42:39,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-02-10 20:42:39,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:39,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:39,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-02-10 20:42:39,007 INFO L427 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-02-10 20:42:39,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:39,007 INFO L82 PathProgramCache]: Analyzing trace with hash -777492557, now seen corresponding path program 206 times [2020-02-10 20:42:39,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:39,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57416400] [2020-02-10 20:42:39,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:39,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57416400] [2020-02-10 20:42:39,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:39,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:39,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936375703] [2020-02-10 20:42:39,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:39,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:39,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:39,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:39,408 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:42:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:39,556 INFO L93 Difference]: Finished difference Result 1439 states and 5003 transitions. [2020-02-10 20:42:39,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:39,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:39,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:39,560 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 20:42:39,560 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 20:42:39,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-02-10 20:42:39,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 20:42:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 793. [2020-02-10 20:42:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:42:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-02-10 20:42:39,585 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-02-10 20:42:39,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:39,585 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-02-10 20:42:39,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:39,585 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-02-10 20:42:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:39,586 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:39,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-02-10 20:42:39,586 INFO L427 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-02-10 20:42:39,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:39,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2083317777, now seen corresponding path program 207 times [2020-02-10 20:42:39,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:39,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633608758] [2020-02-10 20:42:39,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:39,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633608758] [2020-02-10 20:42:39,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:39,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:39,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453718767] [2020-02-10 20:42:40,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:40,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:40,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:40,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:40,000 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:42:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:40,145 INFO L93 Difference]: Finished difference Result 1439 states and 5002 transitions. [2020-02-10 20:42:40,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:40,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:40,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:40,149 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 20:42:40,150 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 20:42:40,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-02-10 20:42:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 20:42:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 798. [2020-02-10 20:42:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:42:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3166 transitions. [2020-02-10 20:42:40,174 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3166 transitions. Word has length 25 [2020-02-10 20:42:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:40,174 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3166 transitions. [2020-02-10 20:42:40,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3166 transitions. [2020-02-10 20:42:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:40,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:40,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:40,175 INFO L427 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-02-10 20:42:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1199385489, now seen corresponding path program 208 times [2020-02-10 20:42:40,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:40,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591355451] [2020-02-10 20:42:40,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:40,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591355451] [2020-02-10 20:42:40,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:40,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:40,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762705879] [2020-02-10 20:42:40,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:40,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:40,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:40,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:40,595 INFO L87 Difference]: Start difference. First operand 798 states and 3166 transitions. Second operand 10 states. [2020-02-10 20:42:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:40,743 INFO L93 Difference]: Finished difference Result 1444 states and 5007 transitions. [2020-02-10 20:42:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:40,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:40,747 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 20:42:40,747 INFO L226 Difference]: Without dead ends: 1421 [2020-02-10 20:42:40,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-02-10 20:42:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-02-10 20:42:40,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 793. [2020-02-10 20:42:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:42:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-02-10 20:42:40,772 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-02-10 20:42:40,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:40,772 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-02-10 20:42:40,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-02-10 20:42:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:40,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:40,773 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:40,773 INFO L427 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-02-10 20:42:40,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:40,774 INFO L82 PathProgramCache]: Analyzing trace with hash 537921301, now seen corresponding path program 209 times [2020-02-10 20:42:40,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:40,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624944] [2020-02-10 20:42:40,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:41,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624944] [2020-02-10 20:42:41,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:41,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:41,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959452292] [2020-02-10 20:42:41,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:41,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:41,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:41,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:41,183 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:42:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:41,347 INFO L93 Difference]: Finished difference Result 1449 states and 5019 transitions. [2020-02-10 20:42:41,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:41,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:41,351 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:42:41,351 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 20:42:41,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-02-10 20:42:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 20:42:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 802. [2020-02-10 20:42:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:42:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3168 transitions. [2020-02-10 20:42:41,376 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3168 transitions. Word has length 25 [2020-02-10 20:42:41,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:41,376 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3168 transitions. [2020-02-10 20:42:41,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3168 transitions. [2020-02-10 20:42:41,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:41,378 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:41,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-02-10 20:42:41,378 INFO L427 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-02-10 20:42:41,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:41,378 INFO L82 PathProgramCache]: Analyzing trace with hash -535164079, now seen corresponding path program 210 times [2020-02-10 20:42:41,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:41,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834064355] [2020-02-10 20:42:41,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:41,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834064355] [2020-02-10 20:42:41,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:41,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:41,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781370634] [2020-02-10 20:42:41,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:41,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:41,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:41,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:41,815 INFO L87 Difference]: Start difference. First operand 802 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:42:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:41,948 INFO L93 Difference]: Finished difference Result 1451 states and 5015 transitions. [2020-02-10 20:42:41,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:41,949 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:41,952 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 20:42:41,952 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:42:41,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:42:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 787. [2020-02-10 20:42:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:42:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3136 transitions. [2020-02-10 20:42:41,987 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3136 transitions. Word has length 25 [2020-02-10 20:42:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:41,987 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3136 transitions. [2020-02-10 20:42:41,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3136 transitions. [2020-02-10 20:42:41,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:41,989 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:41,989 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:41,989 INFO L427 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-02-10 20:42:41,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:41,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1340772783, now seen corresponding path program 211 times [2020-02-10 20:42:41,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:41,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21251620] [2020-02-10 20:42:41,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:42,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21251620] [2020-02-10 20:42:42,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:42,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:42,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559293311] [2020-02-10 20:42:42,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:42,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:42,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:42,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:42,394 INFO L87 Difference]: Start difference. First operand 787 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:42:42,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:42,528 INFO L93 Difference]: Finished difference Result 1429 states and 4977 transitions. [2020-02-10 20:42:42,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:42,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:42,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:42,532 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:42:42,532 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 20:42:42,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:42,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 20:42:42,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 795. [2020-02-10 20:42:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:42:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3157 transitions. [2020-02-10 20:42:42,557 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3157 transitions. Word has length 25 [2020-02-10 20:42:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:42,557 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3157 transitions. [2020-02-10 20:42:42,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3157 transitions. [2020-02-10 20:42:42,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:42,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:42,558 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:42,558 INFO L427 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-02-10 20:42:42,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:42,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1343253555, now seen corresponding path program 212 times [2020-02-10 20:42:42,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:42,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405176222] [2020-02-10 20:42:42,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:42,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405176222] [2020-02-10 20:42:42,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:42,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:42,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416961994] [2020-02-10 20:42:42,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:42,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:42,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:42,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:42,975 INFO L87 Difference]: Start difference. First operand 795 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:42:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:43,135 INFO L93 Difference]: Finished difference Result 1433 states and 4982 transitions. [2020-02-10 20:42:43,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:43,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:43,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:43,141 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 20:42:43,141 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 20:42:43,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-02-10 20:42:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 20:42:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 792. [2020-02-10 20:42:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:42:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 20:42:43,165 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 20:42:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:43,165 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 20:42:43,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 20:42:43,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:43,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:43,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:43,167 INFO L427 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-02-10 20:42:43,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:43,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1860102925, now seen corresponding path program 213 times [2020-02-10 20:42:43,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:43,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364112987] [2020-02-10 20:42:43,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:43,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364112987] [2020-02-10 20:42:43,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:43,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:43,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119548794] [2020-02-10 20:42:43,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:43,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:43,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:43,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:43,563 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:42:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:43,707 INFO L93 Difference]: Finished difference Result 1432 states and 4979 transitions. [2020-02-10 20:42:43,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:43,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:43,711 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:42:43,712 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 20:42:43,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-02-10 20:42:43,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 20:42:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 796. [2020-02-10 20:42:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:42:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3156 transitions. [2020-02-10 20:42:43,736 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3156 transitions. Word has length 25 [2020-02-10 20:42:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:43,736 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3156 transitions. [2020-02-10 20:42:43,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3156 transitions. [2020-02-10 20:42:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:43,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:43,738 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:43,738 INFO L427 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-02-10 20:42:43,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:43,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1322247347, now seen corresponding path program 214 times [2020-02-10 20:42:43,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:43,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706994543] [2020-02-10 20:42:43,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:44,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:44,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706994543] [2020-02-10 20:42:44,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:44,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:44,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003919999] [2020-02-10 20:42:44,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:44,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:44,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:44,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:44,147 INFO L87 Difference]: Start difference. First operand 796 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:42:44,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:44,293 INFO L93 Difference]: Finished difference Result 1438 states and 4987 transitions. [2020-02-10 20:42:44,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:44,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:44,297 INFO L225 Difference]: With dead ends: 1438 [2020-02-10 20:42:44,297 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:42:44,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-02-10 20:42:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:42:44,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 792. [2020-02-10 20:42:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:42:44,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 20:42:44,322 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 20:42:44,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:44,322 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 20:42:44,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 20:42:44,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:44,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:44,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-02-10 20:42:44,323 INFO L427 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-02-10 20:42:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:44,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1849599821, now seen corresponding path program 215 times [2020-02-10 20:42:44,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:44,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064554748] [2020-02-10 20:42:44,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:44,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064554748] [2020-02-10 20:42:44,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:44,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:44,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15892611] [2020-02-10 20:42:44,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:44,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:44,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:44,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:44,735 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:42:44,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:44,877 INFO L93 Difference]: Finished difference Result 1445 states and 5004 transitions. [2020-02-10 20:42:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:44,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:44,881 INFO L225 Difference]: With dead ends: 1445 [2020-02-10 20:42:44,881 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 20:42:44,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 20:42:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 801. [2020-02-10 20:42:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:42:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3161 transitions. [2020-02-10 20:42:44,905 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3161 transitions. Word has length 25 [2020-02-10 20:42:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:44,906 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3161 transitions. [2020-02-10 20:42:44,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3161 transitions. [2020-02-10 20:42:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:44,907 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:44,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-02-10 20:42:44,907 INFO L427 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-02-10 20:42:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:44,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1372282095, now seen corresponding path program 216 times [2020-02-10 20:42:44,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:44,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529605354] [2020-02-10 20:42:44,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:45,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529605354] [2020-02-10 20:42:45,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:45,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:45,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941328158] [2020-02-10 20:42:45,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:45,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:45,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:45,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:45,336 INFO L87 Difference]: Start difference. First operand 801 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:42:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:45,468 INFO L93 Difference]: Finished difference Result 1447 states and 5000 transitions. [2020-02-10 20:42:45,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:45,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:45,472 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:42:45,472 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:42:45,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:45,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:42:45,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 782. [2020-02-10 20:42:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:42:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3122 transitions. [2020-02-10 20:42:45,496 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3122 transitions. Word has length 25 [2020-02-10 20:42:45,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:45,496 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3122 transitions. [2020-02-10 20:42:45,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3122 transitions. [2020-02-10 20:42:45,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:45,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:45,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-02-10 20:42:45,497 INFO L427 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-02-10 20:42:45,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:45,498 INFO L82 PathProgramCache]: Analyzing trace with hash -842530889, now seen corresponding path program 217 times [2020-02-10 20:42:45,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:45,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111694064] [2020-02-10 20:42:45,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:45,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111694064] [2020-02-10 20:42:45,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:45,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:45,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040812866] [2020-02-10 20:42:45,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:45,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:45,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:45,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:45,907 INFO L87 Difference]: Start difference. First operand 782 states and 3122 transitions. Second operand 10 states. [2020-02-10 20:42:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:46,052 INFO L93 Difference]: Finished difference Result 1432 states and 4997 transitions. [2020-02-10 20:42:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:46,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:46,055 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:42:46,056 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 20:42:46,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 20:42:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 794. [2020-02-10 20:42:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:42:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3161 transitions. [2020-02-10 20:42:46,080 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3161 transitions. Word has length 25 [2020-02-10 20:42:46,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:46,080 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3161 transitions. [2020-02-10 20:42:46,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3161 transitions. [2020-02-10 20:42:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:46,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:46,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-02-10 20:42:46,081 INFO L427 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-02-10 20:42:46,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:46,081 INFO L82 PathProgramCache]: Analyzing trace with hash 768410069, now seen corresponding path program 218 times [2020-02-10 20:42:46,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:46,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287671587] [2020-02-10 20:42:46,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:46,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287671587] [2020-02-10 20:42:46,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:46,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:46,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211362294] [2020-02-10 20:42:46,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:46,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:46,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:46,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:46,480 INFO L87 Difference]: Start difference. First operand 794 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:42:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:46,626 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-02-10 20:42:46,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:46,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:46,630 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:42:46,630 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 20:42:46,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:46,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 20:42:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 791. [2020-02-10 20:42:46,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:42:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3153 transitions. [2020-02-10 20:42:46,655 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3153 transitions. Word has length 25 [2020-02-10 20:42:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:46,655 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3153 transitions. [2020-02-10 20:42:46,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3153 transitions. [2020-02-10 20:42:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:46,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:46,656 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:46,656 INFO L427 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-02-10 20:42:46,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:46,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1851998553, now seen corresponding path program 219 times [2020-02-10 20:42:46,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:46,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393264924] [2020-02-10 20:42:46,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:47,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393264924] [2020-02-10 20:42:47,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:47,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:47,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516044134] [2020-02-10 20:42:47,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:47,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:47,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:47,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:47,054 INFO L87 Difference]: Start difference. First operand 791 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:42:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:47,204 INFO L93 Difference]: Finished difference Result 1439 states and 5011 transitions. [2020-02-10 20:42:47,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:47,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:47,208 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 20:42:47,209 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:42:47,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-02-10 20:42:47,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:42:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 797. [2020-02-10 20:42:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:42:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3164 transitions. [2020-02-10 20:42:47,234 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3164 transitions. Word has length 25 [2020-02-10 20:42:47,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:47,234 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3164 transitions. [2020-02-10 20:42:47,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:47,234 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3164 transitions. [2020-02-10 20:42:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:47,235 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:47,235 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:47,235 INFO L427 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-02-10 20:42:47,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:47,235 INFO L82 PathProgramCache]: Analyzing trace with hash 778913173, now seen corresponding path program 220 times [2020-02-10 20:42:47,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:47,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549945786] [2020-02-10 20:42:47,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:47,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-02-10 20:42:47,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549945786] [2020-02-10 20:42:47,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:47,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:47,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597728641] [2020-02-10 20:42:47,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:47,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:47,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:47,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:47,654 INFO L87 Difference]: Start difference. First operand 797 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:42:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:47,805 INFO L93 Difference]: Finished difference Result 1440 states and 5007 transitions. [2020-02-10 20:42:47,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:47,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:47,808 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:42:47,808 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:42:47,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:42:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 791. [2020-02-10 20:42:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:42:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-02-10 20:42:47,832 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-02-10 20:42:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:47,832 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-02-10 20:42:47,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-02-10 20:42:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:47,833 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:47,833 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:47,833 INFO L427 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-02-10 20:42:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:47,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1862501657, now seen corresponding path program 221 times [2020-02-10 20:42:47,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:47,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020573083] [2020-02-10 20:42:47,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:48,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020573083] [2020-02-10 20:42:48,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:48,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:48,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444264146] [2020-02-10 20:42:48,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:48,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:48,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:48,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:48,239 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:42:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:48,406 INFO L93 Difference]: Finished difference Result 1430 states and 4987 transitions. [2020-02-10 20:42:48,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:48,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:48,410 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 20:42:48,410 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:42:48,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-02-10 20:42:48,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:42:48,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 794. [2020-02-10 20:42:48,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:42:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3155 transitions. [2020-02-10 20:42:48,435 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3155 transitions. Word has length 25 [2020-02-10 20:42:48,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:48,435 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3155 transitions. [2020-02-10 20:42:48,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:48,435 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3155 transitions. [2020-02-10 20:42:48,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:48,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:48,437 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:48,437 INFO L427 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-02-10 20:42:48,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:48,437 INFO L82 PathProgramCache]: Analyzing trace with hash -821524681, now seen corresponding path program 222 times [2020-02-10 20:42:48,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:48,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001259012] [2020-02-10 20:42:48,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:48,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001259012] [2020-02-10 20:42:48,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:48,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:48,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133610725] [2020-02-10 20:42:48,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:48,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:48,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:48,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:48,860 INFO L87 Difference]: Start difference. First operand 794 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:42:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:49,011 INFO L93 Difference]: Finished difference Result 1434 states and 4992 transitions. [2020-02-10 20:42:49,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:49,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:49,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:49,015 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:42:49,015 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:42:49,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-02-10 20:42:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:42:49,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 788. [2020-02-10 20:42:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:42:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-02-10 20:42:49,043 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-02-10 20:42:49,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:49,043 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-02-10 20:42:49,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:49,043 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-02-10 20:42:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:49,044 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:49,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:49,044 INFO L427 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-02-10 20:42:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1285430029, now seen corresponding path program 223 times [2020-02-10 20:42:49,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:49,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403021078] [2020-02-10 20:42:49,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:49,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-02-10 20:42:49,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403021078] [2020-02-10 20:42:49,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:49,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:49,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660166661] [2020-02-10 20:42:49,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:49,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:49,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:49,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:49,447 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:42:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:49,593 INFO L93 Difference]: Finished difference Result 1437 states and 5004 transitions. [2020-02-10 20:42:49,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:49,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:49,597 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 20:42:49,597 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 20:42:49,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:49,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 20:42:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 795. [2020-02-10 20:42:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:42:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3161 transitions. [2020-02-10 20:42:49,623 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3161 transitions. Word has length 25 [2020-02-10 20:42:49,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:49,623 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3161 transitions. [2020-02-10 20:42:49,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3161 transitions. [2020-02-10 20:42:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:49,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:49,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-02-10 20:42:49,624 INFO L427 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-02-10 20:42:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash 325510929, now seen corresponding path program 224 times [2020-02-10 20:42:49,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:49,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55621448] [2020-02-10 20:42:49,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:50,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55621448] [2020-02-10 20:42:50,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:50,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:50,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900204720] [2020-02-10 20:42:50,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:50,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:50,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:50,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:50,038 INFO L87 Difference]: Start difference. First operand 795 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:42:50,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:50,188 INFO L93 Difference]: Finished difference Result 1434 states and 4995 transitions. [2020-02-10 20:42:50,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:50,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:50,193 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:42:50,193 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 20:42:50,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-02-10 20:42:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 20:42:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 792. [2020-02-10 20:42:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:42:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3153 transitions. [2020-02-10 20:42:50,217 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3153 transitions. Word has length 25 [2020-02-10 20:42:50,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:50,218 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3153 transitions. [2020-02-10 20:42:50,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3153 transitions. [2020-02-10 20:42:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:50,219 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:50,219 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:50,219 INFO L427 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-02-10 20:42:50,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:50,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1791776295, now seen corresponding path program 225 times [2020-02-10 20:42:50,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:50,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319486077] [2020-02-10 20:42:50,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:50,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319486077] [2020-02-10 20:42:50,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:50,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:50,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757120450] [2020-02-10 20:42:50,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:50,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:50,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:50,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:50,619 INFO L87 Difference]: Start difference. First operand 792 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:42:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:50,769 INFO L93 Difference]: Finished difference Result 1447 states and 5023 transitions. [2020-02-10 20:42:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:50,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:50,773 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:42:50,773 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:42:50,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:42:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 799. [2020-02-10 20:42:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:42:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3166 transitions. [2020-02-10 20:42:50,797 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3166 transitions. Word has length 25 [2020-02-10 20:42:50,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:50,797 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3166 transitions. [2020-02-10 20:42:50,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3166 transitions. [2020-02-10 20:42:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:50,798 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:50,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-02-10 20:42:50,798 INFO L427 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-02-10 20:42:50,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:50,798 INFO L82 PathProgramCache]: Analyzing trace with hash 357020241, now seen corresponding path program 226 times [2020-02-10 20:42:50,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:50,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321943019] [2020-02-10 20:42:50,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:51,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321943019] [2020-02-10 20:42:51,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:51,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:51,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600068387] [2020-02-10 20:42:51,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:51,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:51,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:51,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:51,219 INFO L87 Difference]: Start difference. First operand 799 states and 3166 transitions. Second operand 10 states. [2020-02-10 20:42:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:51,340 INFO L93 Difference]: Finished difference Result 1450 states and 5022 transitions. [2020-02-10 20:42:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:51,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:51,345 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 20:42:51,345 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 20:42:51,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 20:42:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 792. [2020-02-10 20:42:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:42:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 20:42:51,369 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 20:42:51,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:51,369 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 20:42:51,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:51,369 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 20:42:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:51,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:51,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-02-10 20:42:51,371 INFO L427 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-02-10 20:42:51,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:51,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1781273191, now seen corresponding path program 227 times [2020-02-10 20:42:51,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:51,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405423289] [2020-02-10 20:42:51,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:51,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405423289] [2020-02-10 20:42:51,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:51,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:51,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589102345] [2020-02-10 20:42:51,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:51,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:51,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:51,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:51,782 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:42:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:51,949 INFO L93 Difference]: Finished difference Result 1438 states and 4998 transitions. [2020-02-10 20:42:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:51,949 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:51,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:51,953 INFO L225 Difference]: With dead ends: 1438 [2020-02-10 20:42:51,953 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 20:42:51,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 20:42:51,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 796. [2020-02-10 20:42:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:42:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3156 transitions. [2020-02-10 20:42:51,977 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3156 transitions. Word has length 25 [2020-02-10 20:42:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:51,978 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3156 transitions. [2020-02-10 20:42:51,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3156 transitions. [2020-02-10 20:42:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:51,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:51,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-02-10 20:42:51,979 INFO L427 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-02-10 20:42:51,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:51,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1243417613, now seen corresponding path program 228 times [2020-02-10 20:42:51,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:51,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405733053] [2020-02-10 20:42:51,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:52,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405733053] [2020-02-10 20:42:52,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:52,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:52,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218238361] [2020-02-10 20:42:52,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:52,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:52,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:52,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:52,409 INFO L87 Difference]: Start difference. First operand 796 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:42:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:52,527 INFO L93 Difference]: Finished difference Result 1444 states and 5006 transitions. [2020-02-10 20:42:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:52,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:52,532 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 20:42:52,532 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:42:52,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:42:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 788. [2020-02-10 20:42:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:42:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 20:42:52,556 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 20:42:52,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:52,556 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 20:42:52,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 20:42:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:52,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:52,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-02-10 20:42:52,557 INFO L427 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-02-10 20:42:52,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:52,557 INFO L82 PathProgramCache]: Analyzing trace with hash -959833805, now seen corresponding path program 229 times [2020-02-10 20:42:52,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:52,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957999403] [2020-02-10 20:42:52,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:52,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957999403] [2020-02-10 20:42:52,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:52,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:52,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865765166] [2020-02-10 20:42:52,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:52,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:52,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:52,964 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:42:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:53,108 INFO L93 Difference]: Finished difference Result 1461 states and 5062 transitions. [2020-02-10 20:42:53,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:53,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:53,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:53,112 INFO L225 Difference]: With dead ends: 1461 [2020-02-10 20:42:53,113 INFO L226 Difference]: Without dead ends: 1446 [2020-02-10 20:42:53,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-02-10 20:42:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-02-10 20:42:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 803. [2020-02-10 20:42:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:42:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3178 transitions. [2020-02-10 20:42:53,138 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3178 transitions. Word has length 25 [2020-02-10 20:42:53,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:53,138 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3178 transitions. [2020-02-10 20:42:53,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3178 transitions. [2020-02-10 20:42:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:53,139 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:53,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-02-10 20:42:53,140 INFO L427 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-02-10 20:42:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:53,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2032919185, now seen corresponding path program 230 times [2020-02-10 20:42:53,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:53,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883991395] [2020-02-10 20:42:53,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:53,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883991395] [2020-02-10 20:42:53,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:53,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:53,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939064377] [2020-02-10 20:42:53,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:53,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:53,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:53,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:53,559 INFO L87 Difference]: Start difference. First operand 803 states and 3178 transitions. Second operand 10 states. [2020-02-10 20:42:53,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:53,711 INFO L93 Difference]: Finished difference Result 1462 states and 5058 transitions. [2020-02-10 20:42:53,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:53,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:53,715 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 20:42:53,716 INFO L226 Difference]: Without dead ends: 1440 [2020-02-10 20:42:53,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-02-10 20:42:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-02-10 20:42:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 797. [2020-02-10 20:42:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:42:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-02-10 20:42:53,740 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-02-10 20:42:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:53,740 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-02-10 20:42:53,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-02-10 20:42:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:53,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:53,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-02-10 20:42:53,741 INFO L427 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-02-10 20:42:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:53,742 INFO L82 PathProgramCache]: Analyzing trace with hash 134257783, now seen corresponding path program 231 times [2020-02-10 20:42:53,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:53,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394171746] [2020-02-10 20:42:53,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:54,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394171746] [2020-02-10 20:42:54,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:54,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:54,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655571775] [2020-02-10 20:42:54,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:54,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:54,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:54,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:54,162 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:42:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:54,348 INFO L93 Difference]: Finished difference Result 1464 states and 5061 transitions. [2020-02-10 20:42:54,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:54,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:54,352 INFO L225 Difference]: With dead ends: 1464 [2020-02-10 20:42:54,353 INFO L226 Difference]: Without dead ends: 1449 [2020-02-10 20:42:54,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-02-10 20:42:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 804. [2020-02-10 20:42:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:42:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3174 transitions. [2020-02-10 20:42:54,377 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3174 transitions. Word has length 25 [2020-02-10 20:42:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:54,377 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3174 transitions. [2020-02-10 20:42:54,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3174 transitions. [2020-02-10 20:42:54,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:54,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:54,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-02-10 20:42:54,379 INFO L427 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-02-10 20:42:54,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:54,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2011912977, now seen corresponding path program 232 times [2020-02-10 20:42:54,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:54,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246340442] [2020-02-10 20:42:54,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:54,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246340442] [2020-02-10 20:42:54,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:54,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:54,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970467965] [2020-02-10 20:42:54,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:54,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:54,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:54,806 INFO L87 Difference]: Start difference. First operand 804 states and 3174 transitions. Second operand 10 states. [2020-02-10 20:42:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:54,931 INFO L93 Difference]: Finished difference Result 1467 states and 5060 transitions. [2020-02-10 20:42:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:54,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:54,934 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 20:42:54,935 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 20:42:54,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-02-10 20:42:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 20:42:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 797. [2020-02-10 20:42:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:42:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3154 transitions. [2020-02-10 20:42:54,968 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3154 transitions. Word has length 25 [2020-02-10 20:42:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:54,969 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3154 transitions. [2020-02-10 20:42:54,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3154 transitions. [2020-02-10 20:42:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:54,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:54,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-02-10 20:42:54,971 INFO L427 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-02-10 20:42:54,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:54,971 INFO L82 PathProgramCache]: Analyzing trace with hash 155263991, now seen corresponding path program 233 times [2020-02-10 20:42:54,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:54,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262082958] [2020-02-10 20:42:54,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:55,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-02-10 20:42:55,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262082958] [2020-02-10 20:42:55,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:55,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:55,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437358087] [2020-02-10 20:42:55,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:55,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:55,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:55,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:55,389 INFO L87 Difference]: Start difference. First operand 797 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:42:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:55,541 INFO L93 Difference]: Finished difference Result 1468 states and 5062 transitions. [2020-02-10 20:42:55,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:55,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:55,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:55,545 INFO L225 Difference]: With dead ends: 1468 [2020-02-10 20:42:55,545 INFO L226 Difference]: Without dead ends: 1452 [2020-02-10 20:42:55,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-02-10 20:42:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 806. [2020-02-10 20:42:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-02-10 20:42:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3170 transitions. [2020-02-10 20:42:55,570 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3170 transitions. Word has length 25 [2020-02-10 20:42:55,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:55,570 INFO L479 AbstractCegarLoop]: Abstraction has 806 states and 3170 transitions. [2020-02-10 20:42:55,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3170 transitions. [2020-02-10 20:42:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:55,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:55,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-02-10 20:42:55,572 INFO L427 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-02-10 20:42:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:55,572 INFO L82 PathProgramCache]: Analyzing trace with hash -917821389, now seen corresponding path program 234 times [2020-02-10 20:42:55,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:55,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748278824] [2020-02-10 20:42:55,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:56,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748278824] [2020-02-10 20:42:56,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:56,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:56,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142764184] [2020-02-10 20:42:56,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:56,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:56,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:56,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:56,017 INFO L87 Difference]: Start difference. First operand 806 states and 3170 transitions. Second operand 10 states. [2020-02-10 20:42:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:56,189 INFO L93 Difference]: Finished difference Result 1470 states and 5058 transitions. [2020-02-10 20:42:56,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:56,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:56,194 INFO L225 Difference]: With dead ends: 1470 [2020-02-10 20:42:56,194 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 20:42:56,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:56,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 20:42:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 788. [2020-02-10 20:42:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:42:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3132 transitions. [2020-02-10 20:42:56,219 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3132 transitions. Word has length 25 [2020-02-10 20:42:56,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:56,219 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3132 transitions. [2020-02-10 20:42:56,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3132 transitions. [2020-02-10 20:42:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:56,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:56,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-02-10 20:42:56,220 INFO L427 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-02-10 20:42:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:56,220 INFO L82 PathProgramCache]: Analyzing trace with hash 976703377, now seen corresponding path program 235 times [2020-02-10 20:42:56,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:56,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645427864] [2020-02-10 20:42:56,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:56,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645427864] [2020-02-10 20:42:56,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:56,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:56,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594388621] [2020-02-10 20:42:56,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:56,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:56,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:56,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:56,624 INFO L87 Difference]: Start difference. First operand 788 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:42:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:56,795 INFO L93 Difference]: Finished difference Result 1439 states and 4998 transitions. [2020-02-10 20:42:56,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:56,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:56,798 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 20:42:56,799 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 20:42:56,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-02-10 20:42:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 20:42:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 796. [2020-02-10 20:42:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:42:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3153 transitions. [2020-02-10 20:42:56,823 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3153 transitions. Word has length 25 [2020-02-10 20:42:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:56,823 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3153 transitions. [2020-02-10 20:42:56,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3153 transitions. [2020-02-10 20:42:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:56,824 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:56,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-02-10 20:42:56,825 INFO L427 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-02-10 20:42:56,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:56,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1707322961, now seen corresponding path program 236 times [2020-02-10 20:42:56,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:56,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550819385] [2020-02-10 20:42:56,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:57,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550819385] [2020-02-10 20:42:57,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:57,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:57,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265906430] [2020-02-10 20:42:57,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:57,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:57,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:57,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:57,220 INFO L87 Difference]: Start difference. First operand 796 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:42:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:57,372 INFO L93 Difference]: Finished difference Result 1443 states and 5003 transitions. [2020-02-10 20:42:57,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:57,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:57,376 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 20:42:57,376 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:42:57,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:42:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 793. [2020-02-10 20:42:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:42:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3145 transitions. [2020-02-10 20:42:57,400 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3145 transitions. Word has length 25 [2020-02-10 20:42:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:57,400 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3145 transitions. [2020-02-10 20:42:57,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3145 transitions. [2020-02-10 20:42:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:57,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:57,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-02-10 20:42:57,401 INFO L427 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-02-10 20:42:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:57,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2070794965, now seen corresponding path program 237 times [2020-02-10 20:42:57,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:57,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410429968] [2020-02-10 20:42:57,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:57,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410429968] [2020-02-10 20:42:57,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:57,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:57,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352011970] [2020-02-10 20:42:57,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:57,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:57,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:57,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:57,804 INFO L87 Difference]: Start difference. First operand 793 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:42:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:57,956 INFO L93 Difference]: Finished difference Result 1442 states and 5000 transitions. [2020-02-10 20:42:57,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:57,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:57,960 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 20:42:57,960 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 20:42:57,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 20:42:57,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 797. [2020-02-10 20:42:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:42:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3152 transitions. [2020-02-10 20:42:57,986 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3152 transitions. Word has length 25 [2020-02-10 20:42:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:57,986 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3152 transitions. [2020-02-10 20:42:57,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3152 transitions. [2020-02-10 20:42:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:57,988 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:57,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-02-10 20:42:57,988 INFO L427 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-02-10 20:42:57,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:57,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1686316753, now seen corresponding path program 238 times [2020-02-10 20:42:57,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:57,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049493556] [2020-02-10 20:42:57,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:58,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049493556] [2020-02-10 20:42:58,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:58,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:58,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591336515] [2020-02-10 20:42:58,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:58,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:58,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:58,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:58,418 INFO L87 Difference]: Start difference. First operand 797 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:42:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:58,554 INFO L93 Difference]: Finished difference Result 1448 states and 5008 transitions. [2020-02-10 20:42:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:58,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:58,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:58,558 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 20:42:58,559 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 20:42:58,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-02-10 20:42:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 20:42:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 793. [2020-02-10 20:42:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:42:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3141 transitions. [2020-02-10 20:42:58,583 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3141 transitions. Word has length 25 [2020-02-10 20:42:58,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:58,583 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3141 transitions. [2020-02-10 20:42:58,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3141 transitions. [2020-02-10 20:42:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:58,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:58,585 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:58,585 INFO L427 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-02-10 20:42:58,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:58,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2081298069, now seen corresponding path program 239 times [2020-02-10 20:42:58,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:58,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000305374] [2020-02-10 20:42:58,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42: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-02-10 20:42:59,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000305374] [2020-02-10 20:42:59,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:59,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:59,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872627884] [2020-02-10 20:42:59,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:59,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:59,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:59,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:59,008 INFO L87 Difference]: Start difference. First operand 793 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:42:59,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:59,149 INFO L93 Difference]: Finished difference Result 1455 states and 5025 transitions. [2020-02-10 20:42:59,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:59,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:59,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:59,153 INFO L225 Difference]: With dead ends: 1455 [2020-02-10 20:42:59,153 INFO L226 Difference]: Without dead ends: 1439 [2020-02-10 20:42:59,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:59,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-02-10 20:42:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 802. [2020-02-10 20:42:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:42:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3157 transitions. [2020-02-10 20:42:59,178 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3157 transitions. Word has length 25 [2020-02-10 20:42:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:59,178 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3157 transitions. [2020-02-10 20:42:59,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3157 transitions. [2020-02-10 20:42:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:59,180 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:59,180 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:42:59,180 INFO L427 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-02-10 20:42:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:59,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1008212689, now seen corresponding path program 240 times [2020-02-10 20:42:59,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:59,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507970176] [2020-02-10 20:42:59,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:42:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:42:59,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507970176] [2020-02-10 20:42:59,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:42:59,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:42:59,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226912491] [2020-02-10 20:42:59,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:42:59,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:42:59,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:42:59,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:42:59,603 INFO L87 Difference]: Start difference. First operand 802 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:42:59,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:42:59,734 INFO L93 Difference]: Finished difference Result 1457 states and 5021 transitions. [2020-02-10 20:42:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:42:59,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:42:59,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:42:59,739 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:42:59,739 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 20:42:59,739 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:42:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 20:42:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 776. [2020-02-10 20:42:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:42:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3105 transitions. [2020-02-10 20:42:59,764 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3105 transitions. Word has length 25 [2020-02-10 20:42:59,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:42:59,764 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3105 transitions. [2020-02-10 20:42:59,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:42:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3105 transitions. [2020-02-10 20:42:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:42:59,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:42:59,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-02-10 20:42:59,765 INFO L427 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-02-10 20:42:59,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:42:59,765 INFO L82 PathProgramCache]: Analyzing trace with hash -858812617, now seen corresponding path program 241 times [2020-02-10 20:42:59,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:42:59,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131797714] [2020-02-10 20:42:59,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:42:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:00,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131797714] [2020-02-10 20:43:00,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:00,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:00,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423508883] [2020-02-10 20:43:00,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:00,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:00,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:00,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:00,152 INFO L87 Difference]: Start difference. First operand 776 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:43:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:00,300 INFO L93 Difference]: Finished difference Result 1381 states and 4884 transitions. [2020-02-10 20:43:00,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:00,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:00,304 INFO L225 Difference]: With dead ends: 1381 [2020-02-10 20:43:00,304 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:43:00,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:43:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 790. [2020-02-10 20:43:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:43:00,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3159 transitions. [2020-02-10 20:43:00,329 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3159 transitions. Word has length 25 [2020-02-10 20:43:00,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:00,329 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3159 transitions. [2020-02-10 20:43:00,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:00,329 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3159 transitions. [2020-02-10 20:43:00,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:00,330 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:00,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-02-10 20:43:00,330 INFO L427 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-02-10 20:43:00,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:00,330 INFO L82 PathProgramCache]: Analyzing trace with hash 111438997, now seen corresponding path program 242 times [2020-02-10 20:43:00,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:00,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249671696] [2020-02-10 20:43:00,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:00,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249671696] [2020-02-10 20:43:00,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:00,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:00,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144517686] [2020-02-10 20:43:00,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:00,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:00,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:00,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:00,730 INFO L87 Difference]: Start difference. First operand 790 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:43:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:00,877 INFO L93 Difference]: Finished difference Result 1383 states and 4884 transitions. [2020-02-10 20:43:00,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:00,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:00,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:00,881 INFO L225 Difference]: With dead ends: 1383 [2020-02-10 20:43:00,881 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 20:43:00,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 20:43:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 786. [2020-02-10 20:43:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:43:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3149 transitions. [2020-02-10 20:43:00,905 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3149 transitions. Word has length 25 [2020-02-10 20:43:00,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:00,905 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3149 transitions. [2020-02-10 20:43:00,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3149 transitions. [2020-02-10 20:43:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:00,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:00,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-02-10 20:43:00,906 INFO L427 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-02-10 20:43:00,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:00,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1067221461, now seen corresponding path program 243 times [2020-02-10 20:43:00,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:00,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301549987] [2020-02-10 20:43:00,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:01,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301549987] [2020-02-10 20:43:01,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:01,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:01,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488363679] [2020-02-10 20:43:01,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:01,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:01,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:01,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:01,309 INFO L87 Difference]: Start difference. First operand 786 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:43:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:01,457 INFO L93 Difference]: Finished difference Result 1377 states and 4872 transitions. [2020-02-10 20:43:01,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:01,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:01,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:01,460 INFO L225 Difference]: With dead ends: 1377 [2020-02-10 20:43:01,461 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 20:43:01,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 20:43:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 789. [2020-02-10 20:43:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:43:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-02-10 20:43:01,484 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-02-10 20:43:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:01,484 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-02-10 20:43:01,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-02-10 20:43:01,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:01,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:01,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-02-10 20:43:01,486 INFO L427 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-02-10 20:43:01,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:01,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2047976179, now seen corresponding path program 244 times [2020-02-10 20:43:01,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:01,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878466091] [2020-02-10 20:43:01,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:01,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878466091] [2020-02-10 20:43:01,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:01,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:01,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760111344] [2020-02-10 20:43:01,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:01,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:01,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:01,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:01,897 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:43:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:02,047 INFO L93 Difference]: Finished difference Result 1376 states and 4867 transitions. [2020-02-10 20:43:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:02,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:02,050 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:43:02,050 INFO L226 Difference]: Without dead ends: 1361 [2020-02-10 20:43:02,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2020-02-10 20:43:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 786. [2020-02-10 20:43:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:43:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3146 transitions. [2020-02-10 20:43:02,074 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3146 transitions. Word has length 25 [2020-02-10 20:43:02,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:02,074 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3146 transitions. [2020-02-10 20:43:02,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3146 transitions. [2020-02-10 20:43:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:02,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:02,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-02-10 20:43:02,076 INFO L427 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-02-10 20:43:02,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:02,076 INFO L82 PathProgramCache]: Analyzing trace with hash 450064183, now seen corresponding path program 245 times [2020-02-10 20:43:02,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:02,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514044277] [2020-02-10 20:43:02,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:02,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514044277] [2020-02-10 20:43:02,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:02,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:02,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077599410] [2020-02-10 20:43:02,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:02,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:02,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:02,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:02,481 INFO L87 Difference]: Start difference. First operand 786 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:43:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:02,622 INFO L93 Difference]: Finished difference Result 1381 states and 4877 transitions. [2020-02-10 20:43:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:02,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:02,626 INFO L225 Difference]: With dead ends: 1381 [2020-02-10 20:43:02,626 INFO L226 Difference]: Without dead ends: 1366 [2020-02-10 20:43:02,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-02-10 20:43:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2020-02-10 20:43:02,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 789. [2020-02-10 20:43:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:43:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-02-10 20:43:02,650 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-02-10 20:43:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:02,650 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-02-10 20:43:02,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-02-10 20:43:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:02,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:02,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-02-10 20:43:02,651 INFO L427 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-02-10 20:43:02,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:02,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2061005141, now seen corresponding path program 246 times [2020-02-10 20:43:02,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:02,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435378497] [2020-02-10 20:43:02,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:03,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435378497] [2020-02-10 20:43:03,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:03,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:03,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587353529] [2020-02-10 20:43:03,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:03,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:03,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:03,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:03,054 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:43:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:03,205 INFO L93 Difference]: Finished difference Result 1378 states and 4868 transitions. [2020-02-10 20:43:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:03,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:03,208 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 20:43:03,208 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 20:43:03,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-02-10 20:43:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 20:43:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 783. [2020-02-10 20:43:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:43:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3138 transitions. [2020-02-10 20:43:03,234 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3138 transitions. Word has length 25 [2020-02-10 20:43:03,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:03,234 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3138 transitions. [2020-02-10 20:43:03,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:03,234 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3138 transitions. [2020-02-10 20:43:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:03,235 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:03,235 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:03,236 INFO L427 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-02-10 20:43:03,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:03,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1703784069, now seen corresponding path program 247 times [2020-02-10 20:43:03,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:03,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810145895] [2020-02-10 20:43:03,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:03,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810145895] [2020-02-10 20:43:03,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:03,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:03,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801223304] [2020-02-10 20:43:03,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:03,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:03,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:03,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:03,638 INFO L87 Difference]: Start difference. First operand 783 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:43:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:03,806 INFO L93 Difference]: Finished difference Result 1387 states and 4898 transitions. [2020-02-10 20:43:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:03,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:03,810 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:43:03,810 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 20:43:03,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 20:43:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 791. [2020-02-10 20:43:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:43:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3160 transitions. [2020-02-10 20:43:03,835 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3160 transitions. Word has length 25 [2020-02-10 20:43:03,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:03,836 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3160 transitions. [2020-02-10 20:43:03,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3160 transitions. [2020-02-10 20:43:03,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:03,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:03,837 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:03,837 INFO L427 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-02-10 20:43:03,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:03,837 INFO L82 PathProgramCache]: Analyzing trace with hash -733532455, now seen corresponding path program 248 times [2020-02-10 20:43:03,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:03,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677326016] [2020-02-10 20:43:03,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:04,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677326016] [2020-02-10 20:43:04,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:04,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:04,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850626880] [2020-02-10 20:43:04,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:04,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:04,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:04,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:04,242 INFO L87 Difference]: Start difference. First operand 791 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:43:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:04,378 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-02-10 20:43:04,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:04,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:04,383 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 20:43:04,383 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 20:43:04,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-02-10 20:43:04,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 20:43:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-02-10 20:43:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:43:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3149 transitions. [2020-02-10 20:43:04,409 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3149 transitions. Word has length 25 [2020-02-10 20:43:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:04,409 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3149 transitions. [2020-02-10 20:43:04,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3149 transitions. [2020-02-10 20:43:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:04,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:04,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-02-10 20:43:04,411 INFO L427 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-02-10 20:43:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:04,412 INFO L82 PathProgramCache]: Analyzing trace with hash -220649131, now seen corresponding path program 249 times [2020-02-10 20:43:04,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:04,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345098028] [2020-02-10 20:43:04,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:04,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345098028] [2020-02-10 20:43:04,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:04,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:04,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157507229] [2020-02-10 20:43:04,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:04,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:04,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:04,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:04,822 INFO L87 Difference]: Start difference. First operand 787 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:43:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:04,964 INFO L93 Difference]: Finished difference Result 1386 states and 4892 transitions. [2020-02-10 20:43:04,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:04,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:04,970 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 20:43:04,970 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 20:43:04,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-02-10 20:43:04,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 20:43:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 791. [2020-02-10 20:43:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:43:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3156 transitions. [2020-02-10 20:43:04,998 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3156 transitions. Word has length 25 [2020-02-10 20:43:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:04,999 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3156 transitions. [2020-02-10 20:43:04,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3156 transitions. [2020-02-10 20:43:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:05,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:05,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:05,000 INFO L427 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-02-10 20:43:05,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:05,001 INFO L82 PathProgramCache]: Analyzing trace with hash 781111795, now seen corresponding path program 250 times [2020-02-10 20:43:05,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:05,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218334304] [2020-02-10 20:43:05,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:05,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-02-10 20:43:05,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218334304] [2020-02-10 20:43:05,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:05,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:05,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243890467] [2020-02-10 20:43:05,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:05,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:05,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:05,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:05,407 INFO L87 Difference]: Start difference. First operand 791 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:43:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:05,554 INFO L93 Difference]: Finished difference Result 1387 states and 4890 transitions. [2020-02-10 20:43:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:05,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:05,559 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:43:05,559 INFO L226 Difference]: Without dead ends: 1369 [2020-02-10 20:43:05,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-02-10 20:43:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2020-02-10 20:43:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 787. [2020-02-10 20:43:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:43:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3145 transitions. [2020-02-10 20:43:05,584 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3145 transitions. Word has length 25 [2020-02-10 20:43:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:05,584 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3145 transitions. [2020-02-10 20:43:05,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3145 transitions. [2020-02-10 20:43:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:05,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:05,585 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:05,585 INFO L427 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-02-10 20:43:05,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:05,585 INFO L82 PathProgramCache]: Analyzing trace with hash 256285179, now seen corresponding path program 251 times [2020-02-10 20:43:05,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:05,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972223953] [2020-02-10 20:43:05,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:05,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972223953] [2020-02-10 20:43:05,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:05,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:05,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719254553] [2020-02-10 20:43:05,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:05,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:05,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:05,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:05,988 INFO L87 Difference]: Start difference. First operand 787 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:43:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:06,122 INFO L93 Difference]: Finished difference Result 1391 states and 4899 transitions. [2020-02-10 20:43:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:06,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:06,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:06,125 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 20:43:06,125 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:43:06,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-02-10 20:43:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:43:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 792. [2020-02-10 20:43:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:43:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3154 transitions. [2020-02-10 20:43:06,149 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3154 transitions. Word has length 25 [2020-02-10 20:43:06,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:06,149 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3154 transitions. [2020-02-10 20:43:06,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3154 transitions. [2020-02-10 20:43:06,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:06,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:06,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-02-10 20:43:06,150 INFO L427 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-02-10 20:43:06,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:06,151 INFO L82 PathProgramCache]: Analyzing trace with hash 794140757, now seen corresponding path program 252 times [2020-02-10 20:43:06,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:06,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054696656] [2020-02-10 20:43:06,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:06,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054696656] [2020-02-10 20:43:06,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:06,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:06,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824723567] [2020-02-10 20:43:06,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:06,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:06,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:06,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:06,559 INFO L87 Difference]: Start difference. First operand 792 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:43:06,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:06,726 INFO L93 Difference]: Finished difference Result 1390 states and 4892 transitions. [2020-02-10 20:43:06,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:06,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:06,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:06,731 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:43:06,731 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 20:43:06,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 20:43:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 783. [2020-02-10 20:43:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:43:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3135 transitions. [2020-02-10 20:43:06,754 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3135 transitions. Word has length 25 [2020-02-10 20:43:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:06,754 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3135 transitions. [2020-02-10 20:43:06,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3135 transitions. [2020-02-10 20:43:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:06,755 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:06,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-02-10 20:43:06,756 INFO L427 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-02-10 20:43:06,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:06,756 INFO L82 PathProgramCache]: Analyzing trace with hash -200235717, now seen corresponding path program 253 times [2020-02-10 20:43:06,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:06,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345891896] [2020-02-10 20:43:06,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:07,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345891896] [2020-02-10 20:43:07,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:07,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:07,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135870845] [2020-02-10 20:43:07,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:07,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:07,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:07,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:07,178 INFO L87 Difference]: Start difference. First operand 783 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:43:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:07,325 INFO L93 Difference]: Finished difference Result 1376 states and 4867 transitions. [2020-02-10 20:43:07,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:07,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:07,330 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:43:07,330 INFO L226 Difference]: Without dead ends: 1363 [2020-02-10 20:43:07,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-02-10 20:43:07,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2020-02-10 20:43:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 789. [2020-02-10 20:43:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:43:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-02-10 20:43:07,355 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-02-10 20:43:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:07,355 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-02-10 20:43:07,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-02-10 20:43:07,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:07,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:07,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-02-10 20:43:07,357 INFO L427 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-02-10 20:43:07,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:07,357 INFO L82 PathProgramCache]: Analyzing trace with hash 780519001, now seen corresponding path program 254 times [2020-02-10 20:43:07,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:07,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942342610] [2020-02-10 20:43:07,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:07,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942342610] [2020-02-10 20:43:07,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:07,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:07,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107027147] [2020-02-10 20:43:07,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:07,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:07,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:07,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:07,767 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:43:07,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:07,910 INFO L93 Difference]: Finished difference Result 1375 states and 4862 transitions. [2020-02-10 20:43:07,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:07,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:07,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:07,914 INFO L225 Difference]: With dead ends: 1375 [2020-02-10 20:43:07,915 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 20:43:07,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:07,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 20:43:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 786. [2020-02-10 20:43:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:43:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3143 transitions. [2020-02-10 20:43:07,939 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3143 transitions. Word has length 25 [2020-02-10 20:43:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:07,939 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3143 transitions. [2020-02-10 20:43:07,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3143 transitions. [2020-02-10 20:43:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:07,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:07,940 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:07,940 INFO L427 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-02-10 20:43:07,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:07,940 INFO L82 PathProgramCache]: Analyzing trace with hash -643134857, now seen corresponding path program 255 times [2020-02-10 20:43:07,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:07,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917514190] [2020-02-10 20:43:07,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:08,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917514190] [2020-02-10 20:43:08,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:08,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:08,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448878844] [2020-02-10 20:43:08,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:08,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:08,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:08,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:08,372 INFO L87 Difference]: Start difference. First operand 786 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:43:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:08,523 INFO L93 Difference]: Finished difference Result 1379 states and 4871 transitions. [2020-02-10 20:43:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:08,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:08,527 INFO L225 Difference]: With dead ends: 1379 [2020-02-10 20:43:08,527 INFO L226 Difference]: Without dead ends: 1366 [2020-02-10 20:43:08,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-02-10 20:43:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2020-02-10 20:43:08,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 790. [2020-02-10 20:43:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:43:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-02-10 20:43:08,551 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-02-10 20:43:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:08,551 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-02-10 20:43:08,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-02-10 20:43:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:08,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:08,552 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:08,552 INFO L427 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-02-10 20:43:08,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:08,552 INFO L82 PathProgramCache]: Analyzing trace with hash 358626069, now seen corresponding path program 256 times [2020-02-10 20:43:08,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:08,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045547368] [2020-02-10 20:43:08,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:09,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045547368] [2020-02-10 20:43:09,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:09,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:09,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319860969] [2020-02-10 20:43:09,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:09,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:09,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:09,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:09,070 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:43:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:09,221 INFO L93 Difference]: Finished difference Result 1380 states and 4869 transitions. [2020-02-10 20:43:09,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:09,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:09,225 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 20:43:09,225 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 20:43:09,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-02-10 20:43:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 20:43:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 786. [2020-02-10 20:43:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:43:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3140 transitions. [2020-02-10 20:43:09,249 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3140 transitions. Word has length 25 [2020-02-10 20:43:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:09,249 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3140 transitions. [2020-02-10 20:43:09,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3140 transitions. [2020-02-10 20:43:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:09,250 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:09,250 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:09,250 INFO L427 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-02-10 20:43:09,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:09,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1770336635, now seen corresponding path program 257 times [2020-02-10 20:43:09,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:09,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320530931] [2020-02-10 20:43:09,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:09,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320530931] [2020-02-10 20:43:09,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:09,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:09,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217798055] [2020-02-10 20:43:09,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:09,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:09,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:09,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:09,655 INFO L87 Difference]: Start difference. First operand 786 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:43:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:09,816 INFO L93 Difference]: Finished difference Result 1376 states and 4861 transitions. [2020-02-10 20:43:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:09,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:09,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:09,820 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:43:09,821 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 20:43:09,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-02-10 20:43:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 20:43:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 789. [2020-02-10 20:43:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:43:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3145 transitions. [2020-02-10 20:43:09,845 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3145 transitions. Word has length 25 [2020-02-10 20:43:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:09,845 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3145 transitions. [2020-02-10 20:43:09,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3145 transitions. [2020-02-10 20:43:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:09,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:09,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-02-10 20:43:09,846 INFO L427 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-02-10 20:43:09,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:09,846 INFO L82 PathProgramCache]: Analyzing trace with hash 697251255, now seen corresponding path program 258 times [2020-02-10 20:43:09,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:09,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240148496] [2020-02-10 20:43:09,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:10,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240148496] [2020-02-10 20:43:10,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:10,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:10,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470364510] [2020-02-10 20:43:10,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:10,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:10,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:10,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:10,250 INFO L87 Difference]: Start difference. First operand 789 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:43:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:10,399 INFO L93 Difference]: Finished difference Result 1378 states and 4862 transitions. [2020-02-10 20:43:10,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:10,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:10,404 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 20:43:10,404 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:43:10,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:43:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 783. [2020-02-10 20:43:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:43:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3132 transitions. [2020-02-10 20:43:10,427 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3132 transitions. Word has length 25 [2020-02-10 20:43:10,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:10,427 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3132 transitions. [2020-02-10 20:43:10,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3132 transitions. [2020-02-10 20:43:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:10,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:10,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-02-10 20:43:10,429 INFO L427 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-02-10 20:43:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:10,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1069639765, now seen corresponding path program 259 times [2020-02-10 20:43:10,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:10,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938158043] [2020-02-10 20:43:10,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:10,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938158043] [2020-02-10 20:43:10,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:10,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:10,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023084275] [2020-02-10 20:43:10,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:10,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:10,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:10,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:10,861 INFO L87 Difference]: Start difference. First operand 783 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:43:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:11,005 INFO L93 Difference]: Finished difference Result 1383 states and 4879 transitions. [2020-02-10 20:43:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:11,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:11,009 INFO L225 Difference]: With dead ends: 1383 [2020-02-10 20:43:11,009 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:43:11,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-02-10 20:43:11,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:43:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 789. [2020-02-10 20:43:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:43:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-02-10 20:43:11,034 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-02-10 20:43:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:11,034 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-02-10 20:43:11,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-02-10 20:43:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:11,036 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:11,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-02-10 20:43:11,036 INFO L427 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-02-10 20:43:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:11,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1614386573, now seen corresponding path program 260 times [2020-02-10 20:43:11,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:11,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629735026] [2020-02-10 20:43:11,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:11,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629735026] [2020-02-10 20:43:11,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:11,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:11,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225098604] [2020-02-10 20:43:11,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:11,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:11,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:11,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:11,440 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:43:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:11,588 INFO L93 Difference]: Finished difference Result 1380 states and 4870 transitions. [2020-02-10 20:43:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:11,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:11,592 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 20:43:11,592 INFO L226 Difference]: Without dead ends: 1365 [2020-02-10 20:43:11,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2020-02-10 20:43:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 786. [2020-02-10 20:43:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:43:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3140 transitions. [2020-02-10 20:43:11,616 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3140 transitions. Word has length 25 [2020-02-10 20:43:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:11,616 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3140 transitions. [2020-02-10 20:43:11,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3140 transitions. [2020-02-10 20:43:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:11,617 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:11,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-02-10 20:43:11,617 INFO L427 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-02-10 20:43:11,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:11,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2131235943, now seen corresponding path program 261 times [2020-02-10 20:43:11,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:11,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110619248] [2020-02-10 20:43:11,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:12,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110619248] [2020-02-10 20:43:12,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:12,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:12,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668596875] [2020-02-10 20:43:12,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:12,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:12,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:12,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:12,017 INFO L87 Difference]: Start difference. First operand 786 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:43:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:12,166 INFO L93 Difference]: Finished difference Result 1387 states and 4886 transitions. [2020-02-10 20:43:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:12,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:12,170 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:43:12,170 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 20:43:12,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-02-10 20:43:12,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 20:43:12,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-02-10 20:43:12,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:43:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3149 transitions. [2020-02-10 20:43:12,194 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3149 transitions. Word has length 25 [2020-02-10 20:43:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:12,194 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3149 transitions. [2020-02-10 20:43:12,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3149 transitions. [2020-02-10 20:43:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:12,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:12,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-02-10 20:43:12,195 INFO L427 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-02-10 20:43:12,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:12,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1593380365, now seen corresponding path program 262 times [2020-02-10 20:43:12,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:12,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990755069] [2020-02-10 20:43:12,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:12,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990755069] [2020-02-10 20:43:12,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:12,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:12,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891630398] [2020-02-10 20:43:12,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:12,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:12,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:12,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:12,599 INFO L87 Difference]: Start difference. First operand 791 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:43:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:12,747 INFO L93 Difference]: Finished difference Result 1386 states and 4879 transitions. [2020-02-10 20:43:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:12,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:12,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:12,751 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 20:43:12,752 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 20:43:12,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 20:43:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 786. [2020-02-10 20:43:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:43:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3137 transitions. [2020-02-10 20:43:12,775 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3137 transitions. Word has length 25 [2020-02-10 20:43:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:12,776 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3137 transitions. [2020-02-10 20:43:12,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3137 transitions. [2020-02-10 20:43:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:12,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:12,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-02-10 20:43:12,777 INFO L427 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-02-10 20:43:12,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:12,777 INFO L82 PathProgramCache]: Analyzing trace with hash -2120732839, now seen corresponding path program 263 times [2020-02-10 20:43:12,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:12,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676192676] [2020-02-10 20:43:12,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:13,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676192676] [2020-02-10 20:43:13,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:13,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:13,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371384639] [2020-02-10 20:43:13,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:13,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:13,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:13,169 INFO L87 Difference]: Start difference. First operand 786 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:43:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:13,332 INFO L93 Difference]: Finished difference Result 1379 states and 4865 transitions. [2020-02-10 20:43:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:13,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:13,336 INFO L225 Difference]: With dead ends: 1379 [2020-02-10 20:43:13,337 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 20:43:13,337 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 20:43:13,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 789. [2020-02-10 20:43:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:43:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3142 transitions. [2020-02-10 20:43:13,361 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3142 transitions. Word has length 25 [2020-02-10 20:43:13,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:13,362 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3142 transitions. [2020-02-10 20:43:13,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:13,362 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3142 transitions. [2020-02-10 20:43:13,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:13,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:13,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-02-10 20:43:13,363 INFO L427 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-02-10 20:43:13,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:13,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1101149077, now seen corresponding path program 264 times [2020-02-10 20:43:13,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:13,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258462787] [2020-02-10 20:43:13,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:13,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258462787] [2020-02-10 20:43:13,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:13,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:13,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117291118] [2020-02-10 20:43:13,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:13,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:13,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:13,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:13,768 INFO L87 Difference]: Start difference. First operand 789 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:43:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:13,912 INFO L93 Difference]: Finished difference Result 1381 states and 4866 transitions. [2020-02-10 20:43:13,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:13,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:13,916 INFO L225 Difference]: With dead ends: 1381 [2020-02-10 20:43:13,916 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:43:13,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-02-10 20:43:13,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:43:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 780. [2020-02-10 20:43:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:43:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3124 transitions. [2020-02-10 20:43:13,940 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3124 transitions. Word has length 25 [2020-02-10 20:43:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:13,940 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3124 transitions. [2020-02-10 20:43:13,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3124 transitions. [2020-02-10 20:43:13,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:13,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:13,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:13,942 INFO L427 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-02-10 20:43:13,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:13,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1070968235, now seen corresponding path program 265 times [2020-02-10 20:43:13,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:13,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883134297] [2020-02-10 20:43:13,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:14,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883134297] [2020-02-10 20:43:14,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:14,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:14,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058233845] [2020-02-10 20:43:14,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:14,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:14,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:14,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:14,342 INFO L87 Difference]: Start difference. First operand 780 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:43:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:14,518 INFO L93 Difference]: Finished difference Result 1393 states and 4910 transitions. [2020-02-10 20:43:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:14,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:14,522 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 20:43:14,523 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:43:14,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:14,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:43:14,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 791. [2020-02-10 20:43:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:43:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3160 transitions. [2020-02-10 20:43:14,547 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3160 transitions. Word has length 25 [2020-02-10 20:43:14,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:14,547 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3160 transitions. [2020-02-10 20:43:14,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3160 transitions. [2020-02-10 20:43:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:14,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:14,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-02-10 20:43:14,549 INFO L427 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-02-10 20:43:14,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:14,549 INFO L82 PathProgramCache]: Analyzing trace with hash -100716621, now seen corresponding path program 266 times [2020-02-10 20:43:14,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:14,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048745837] [2020-02-10 20:43:14,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:14,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:14,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048745837] [2020-02-10 20:43:14,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:14,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:14,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216497030] [2020-02-10 20:43:14,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:14,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:14,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:14,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:14,955 INFO L87 Difference]: Start difference. First operand 791 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:43:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:15,120 INFO L93 Difference]: Finished difference Result 1395 states and 4910 transitions. [2020-02-10 20:43:15,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:15,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:15,125 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:43:15,125 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:43:15,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-02-10 20:43:15,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:43:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 787. [2020-02-10 20:43:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:43:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3150 transitions. [2020-02-10 20:43:15,149 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3150 transitions. Word has length 25 [2020-02-10 20:43:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:15,149 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3150 transitions. [2020-02-10 20:43:15,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3150 transitions. [2020-02-10 20:43:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:15,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:15,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-02-10 20:43:15,150 INFO L427 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-02-10 20:43:15,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:15,151 INFO L82 PathProgramCache]: Analyzing trace with hash 855065843, now seen corresponding path program 267 times [2020-02-10 20:43:15,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:15,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977165961] [2020-02-10 20:43:15,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:15,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977165961] [2020-02-10 20:43:15,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:15,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:15,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371827702] [2020-02-10 20:43:15,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:15,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:15,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:15,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:15,550 INFO L87 Difference]: Start difference. First operand 787 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:43:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:15,736 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-02-10 20:43:15,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:15,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:15,740 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 20:43:15,741 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:43:15,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-02-10 20:43:15,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:43:15,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 790. [2020-02-10 20:43:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:43:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-02-10 20:43:15,778 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-02-10 20:43:15,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:15,778 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-02-10 20:43:15,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-02-10 20:43:15,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:15,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:15,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-02-10 20:43:15,780 INFO L427 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-02-10 20:43:15,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:15,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1835820561, now seen corresponding path program 268 times [2020-02-10 20:43:15,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:15,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336372904] [2020-02-10 20:43:15,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:16,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-02-10 20:43:16,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336372904] [2020-02-10 20:43:16,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:16,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:16,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631296380] [2020-02-10 20:43:16,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:16,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:16,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:16,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:16,178 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:43:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:16,329 INFO L93 Difference]: Finished difference Result 1388 states and 4893 transitions. [2020-02-10 20:43:16,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:16,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:16,332 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 20:43:16,332 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 20:43:16,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 20:43:16,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-02-10 20:43:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:43:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-02-10 20:43:16,355 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-02-10 20:43:16,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:16,356 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-02-10 20:43:16,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-02-10 20:43:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:16,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:16,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-02-10 20:43:16,357 INFO L427 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-02-10 20:43:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash 237908565, now seen corresponding path program 269 times [2020-02-10 20:43:16,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:16,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885003903] [2020-02-10 20:43:16,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:16,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885003903] [2020-02-10 20:43:16,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:16,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:16,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10879111] [2020-02-10 20:43:16,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:16,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:16,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:16,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:16,768 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:43:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:16,923 INFO L93 Difference]: Finished difference Result 1393 states and 4903 transitions. [2020-02-10 20:43:16,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:16,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:16,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:16,927 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 20:43:16,927 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 20:43:16,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 20:43:16,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 790. [2020-02-10 20:43:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:43:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3152 transitions. [2020-02-10 20:43:16,953 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3152 transitions. Word has length 25 [2020-02-10 20:43:16,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:16,954 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3152 transitions. [2020-02-10 20:43:16,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3152 transitions. [2020-02-10 20:43:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:16,955 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:16,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-02-10 20:43:16,955 INFO L427 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-02-10 20:43:16,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:16,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1848849523, now seen corresponding path program 270 times [2020-02-10 20:43:16,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:16,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830906880] [2020-02-10 20:43:16,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:17,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830906880] [2020-02-10 20:43:17,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:17,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:17,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230834367] [2020-02-10 20:43:17,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:17,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:17,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:17,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:17,349 INFO L87 Difference]: Start difference. First operand 790 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:43:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:17,525 INFO L93 Difference]: Finished difference Result 1390 states and 4894 transitions. [2020-02-10 20:43:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:17,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:17,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:17,529 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:43:17,529 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 20:43:17,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-02-10 20:43:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 20:43:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 784. [2020-02-10 20:43:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:43:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3139 transitions. [2020-02-10 20:43:17,554 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3139 transitions. Word has length 25 [2020-02-10 20:43:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:17,554 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3139 transitions. [2020-02-10 20:43:17,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3139 transitions. [2020-02-10 20:43:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:17,555 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:17,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-02-10 20:43:17,555 INFO L427 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-02-10 20:43:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1956541883, now seen corresponding path program 271 times [2020-02-10 20:43:17,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:17,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480278777] [2020-02-10 20:43:17,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:17,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480278777] [2020-02-10 20:43:17,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:17,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:17,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498220175] [2020-02-10 20:43:17,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:17,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:17,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:17,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:17,951 INFO L87 Difference]: Start difference. First operand 784 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:43:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:18,095 INFO L93 Difference]: Finished difference Result 1407 states and 4941 transitions. [2020-02-10 20:43:18,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:18,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:18,099 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 20:43:18,099 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:43:18,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-02-10 20:43:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:43:18,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 793. [2020-02-10 20:43:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:43:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3164 transitions. [2020-02-10 20:43:18,151 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3164 transitions. Word has length 25 [2020-02-10 20:43:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:18,152 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3164 transitions. [2020-02-10 20:43:18,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3164 transitions. [2020-02-10 20:43:18,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:18,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:18,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-02-10 20:43:18,154 INFO L427 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-02-10 20:43:18,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:18,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1368173799, now seen corresponding path program 272 times [2020-02-10 20:43:18,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:18,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197065286] [2020-02-10 20:43:18,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:18,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197065286] [2020-02-10 20:43:18,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:18,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:18,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414450349] [2020-02-10 20:43:18,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:18,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:18,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:18,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:18,532 INFO L87 Difference]: Start difference. First operand 793 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:43:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:18,687 INFO L93 Difference]: Finished difference Result 1409 states and 4941 transitions. [2020-02-10 20:43:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:18,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:18,691 INFO L225 Difference]: With dead ends: 1409 [2020-02-10 20:43:18,691 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:43:18,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:43:18,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-02-10 20:43:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:43:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3153 transitions. [2020-02-10 20:43:18,715 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3153 transitions. Word has length 25 [2020-02-10 20:43:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:18,715 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3153 transitions. [2020-02-10 20:43:18,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3153 transitions. [2020-02-10 20:43:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:18,716 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:18,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-02-10 20:43:18,717 INFO L427 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-02-10 20:43:18,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:18,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1070743603, now seen corresponding path program 273 times [2020-02-10 20:43:18,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:18,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798964153] [2020-02-10 20:43:18,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:19,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798964153] [2020-02-10 20:43:19,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:19,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:19,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85493752] [2020-02-10 20:43:19,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:19,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:19,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:19,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:19,120 INFO L87 Difference]: Start difference. First operand 789 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:43:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:19,313 INFO L93 Difference]: Finished difference Result 1411 states and 4944 transitions. [2020-02-10 20:43:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:19,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:19,317 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:43:19,317 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:43:19,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-02-10 20:43:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:43:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-02-10 20:43:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:43:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-02-10 20:43:19,341 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-02-10 20:43:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:19,342 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-02-10 20:43:19,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-02-10 20:43:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:19,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43: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-02-10 20:43:19,343 INFO L427 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-02-10 20:43:19,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:19,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2083007633, now seen corresponding path program 274 times [2020-02-10 20:43:19,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:19,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607214865] [2020-02-10 20:43:19,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:19,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607214865] [2020-02-10 20:43:19,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:19,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:19,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372496252] [2020-02-10 20:43:19,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:19,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:19,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:19,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:19,745 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:43:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:19,904 INFO L93 Difference]: Finished difference Result 1416 states and 4949 transitions. [2020-02-10 20:43:19,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:19,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:19,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:19,908 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:43:19,908 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:43:19,908 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:43:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-02-10 20:43:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:43:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-02-10 20:43:19,933 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-02-10 20:43:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:19,933 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-02-10 20:43:19,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-02-10 20:43:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:19,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:19,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-02-10 20:43:19,934 INFO L427 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-02-10 20:43:19,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:19,934 INFO L82 PathProgramCache]: Analyzing trace with hash -52759941, now seen corresponding path program 275 times [2020-02-10 20:43:19,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:19,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824780490] [2020-02-10 20:43:19,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:20,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824780490] [2020-02-10 20:43:20,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:20,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:20,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057668270] [2020-02-10 20:43:20,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:20,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:20,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:20,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:20,337 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:43:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:20,492 INFO L93 Difference]: Finished difference Result 1417 states and 4953 transitions. [2020-02-10 20:43:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:20,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:20,497 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 20:43:20,497 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:43:20,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-02-10 20:43:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:43:20,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 796. [2020-02-10 20:43:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:43:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3161 transitions. [2020-02-10 20:43:20,523 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3161 transitions. Word has length 25 [2020-02-10 20:43:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:20,523 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3161 transitions. [2020-02-10 20:43:20,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3161 transitions. [2020-02-10 20:43:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:20,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:20,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:20,524 INFO L427 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-02-10 20:43:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:20,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2096036595, now seen corresponding path program 276 times [2020-02-10 20:43:20,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:20,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511351478] [2020-02-10 20:43:20,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:20,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-02-10 20:43:20,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511351478] [2020-02-10 20:43:20,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:20,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:20,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657972697] [2020-02-10 20:43:20,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:20,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:20,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:20,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:20,923 INFO L87 Difference]: Start difference. First operand 796 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:43:21,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:21,051 INFO L93 Difference]: Finished difference Result 1420 states and 4952 transitions. [2020-02-10 20:43:21,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:21,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:21,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:21,055 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 20:43:21,055 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:43:21,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:43:21,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 784. [2020-02-10 20:43:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:43:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3135 transitions. [2020-02-10 20:43:21,080 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3135 transitions. Word has length 25 [2020-02-10 20:43:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:21,080 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3135 transitions. [2020-02-10 20:43:21,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3135 transitions. [2020-02-10 20:43:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:21,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:21,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-02-10 20:43:21,081 INFO L427 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-02-10 20:43:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash -834877061, now seen corresponding path program 277 times [2020-02-10 20:43:21,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:21,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948305456] [2020-02-10 20:43:21,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:21,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948305456] [2020-02-10 20:43:21,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:21,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:21,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519751485] [2020-02-10 20:43:21,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:21,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:21,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:21,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:21,484 INFO L87 Difference]: Start difference. First operand 784 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:43:21,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:21,655 INFO L93 Difference]: Finished difference Result 1395 states and 4906 transitions. [2020-02-10 20:43:21,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:21,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:21,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:21,658 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:43:21,658 INFO L226 Difference]: Without dead ends: 1382 [2020-02-10 20:43:21,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-02-10 20:43:21,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-02-10 20:43:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 791. [2020-02-10 20:43:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:43:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3154 transitions. [2020-02-10 20:43:21,682 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3154 transitions. Word has length 25 [2020-02-10 20:43:21,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:21,682 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3154 transitions. [2020-02-10 20:43:21,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:21,682 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3154 transitions. [2020-02-10 20:43:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:21,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:21,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-02-10 20:43:21,684 INFO L427 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-02-10 20:43:21,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:21,684 INFO L82 PathProgramCache]: Analyzing trace with hash 145877657, now seen corresponding path program 278 times [2020-02-10 20:43:21,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:21,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049929738] [2020-02-10 20:43:21,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:22,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049929738] [2020-02-10 20:43:22,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:22,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:22,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132719258] [2020-02-10 20:43:22,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:22,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:22,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:22,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:22,088 INFO L87 Difference]: Start difference. First operand 791 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:43:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:22,270 INFO L93 Difference]: Finished difference Result 1394 states and 4901 transitions. [2020-02-10 20:43:22,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:22,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:22,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:22,274 INFO L225 Difference]: With dead ends: 1394 [2020-02-10 20:43:22,274 INFO L226 Difference]: Without dead ends: 1379 [2020-02-10 20:43:22,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-02-10 20:43:22,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 788. [2020-02-10 20:43:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:43:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 20:43:22,298 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 20:43:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:22,298 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 20:43:22,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 20:43:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:22,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:22,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-02-10 20:43:22,299 INFO L427 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-02-10 20:43:22,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:22,300 INFO L82 PathProgramCache]: Analyzing trace with hash 648257877, now seen corresponding path program 279 times [2020-02-10 20:43:22,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:22,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830577206] [2020-02-10 20:43:22,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:22,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830577206] [2020-02-10 20:43:22,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:22,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:22,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034739620] [2020-02-10 20:43:22,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:22,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:22,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:22,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:22,692 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:43:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:22,848 INFO L93 Difference]: Finished difference Result 1403 states and 4919 transitions. [2020-02-10 20:43:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:22,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:22,851 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:43:22,852 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:43:22,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-02-10 20:43:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:43:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 793. [2020-02-10 20:43:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:43:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3155 transitions. [2020-02-10 20:43:22,875 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3155 transitions. Word has length 25 [2020-02-10 20:43:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:22,876 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3155 transitions. [2020-02-10 20:43:22,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3155 transitions. [2020-02-10 20:43:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:22,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:22,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:22,877 INFO L427 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-02-10 20:43:22,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:22,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1660521907, now seen corresponding path program 280 times [2020-02-10 20:43:22,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:22,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783741972] [2020-02-10 20:43:22,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:23,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783741972] [2020-02-10 20:43:23,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:23,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:23,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220046182] [2020-02-10 20:43:23,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:23,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:23,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:23,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:23,287 INFO L87 Difference]: Start difference. First operand 793 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:43:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:23,438 INFO L93 Difference]: Finished difference Result 1408 states and 4924 transitions. [2020-02-10 20:43:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:23,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:23,442 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 20:43:23,442 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:43:23,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:43:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-02-10 20:43:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:43:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-02-10 20:43:23,466 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-02-10 20:43:23,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:23,466 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-02-10 20:43:23,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:23,466 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-02-10 20:43:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:23,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:23,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-02-10 20:43:23,467 INFO L427 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-02-10 20:43:23,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:23,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1461291515, now seen corresponding path program 281 times [2020-02-10 20:43:23,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:23,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080192752] [2020-02-10 20:43:23,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:23,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080192752] [2020-02-10 20:43:23,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:23,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:23,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875781350] [2020-02-10 20:43:23,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:23,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:23,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:23,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:23,887 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:43:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:24,061 INFO L93 Difference]: Finished difference Result 1400 states and 4908 transitions. [2020-02-10 20:43:24,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:24,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:24,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:24,065 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 20:43:24,065 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:43:24,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:24,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:43:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-02-10 20:43:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:43:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 20:43:24,089 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 20:43:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:24,089 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 20:43:24,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 20:43:24,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:24,090 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:24,090 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:24,090 INFO L427 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-02-10 20:43:24,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:24,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1999147093, now seen corresponding path program 282 times [2020-02-10 20:43:24,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:24,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34020072] [2020-02-10 20:43:24,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:24,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34020072] [2020-02-10 20:43:24,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:24,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:24,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119988740] [2020-02-10 20:43:24,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:24,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:24,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:24,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:24,494 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:43:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:24,624 INFO L93 Difference]: Finished difference Result 1406 states and 4916 transitions. [2020-02-10 20:43:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:24,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:24,629 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 20:43:24,629 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:43:24,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-02-10 20:43:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:43:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 784. [2020-02-10 20:43:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:43:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3131 transitions. [2020-02-10 20:43:24,653 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3131 transitions. Word has length 25 [2020-02-10 20:43:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:24,653 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3131 transitions. [2020-02-10 20:43:24,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3131 transitions. [2020-02-10 20:43:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:24,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:24,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:24,654 INFO L427 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-02-10 20:43:24,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:24,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1933934797, now seen corresponding path program 283 times [2020-02-10 20:43:24,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:24,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216483022] [2020-02-10 20:43:24,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:25,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216483022] [2020-02-10 20:43:25,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:25,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:25,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426552626] [2020-02-10 20:43:25,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:25,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:25,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:25,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:25,049 INFO L87 Difference]: Start difference. First operand 784 states and 3131 transitions. Second operand 10 states. [2020-02-10 20:43:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:25,220 INFO L93 Difference]: Finished difference Result 1403 states and 4920 transitions. [2020-02-10 20:43:25,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:25,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:25,223 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:43:25,224 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:43:25,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:43:25,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 791. [2020-02-10 20:43:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:43:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-02-10 20:43:25,247 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-02-10 20:43:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:25,248 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-02-10 20:43:25,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-02-10 20:43:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:25,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:25,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-02-10 20:43:25,249 INFO L427 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-02-10 20:43:25,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:25,249 INFO L82 PathProgramCache]: Analyzing trace with hash -322993839, now seen corresponding path program 284 times [2020-02-10 20:43:25,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:25,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126457942] [2020-02-10 20:43:25,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:25,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126457942] [2020-02-10 20:43:25,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:25,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:25,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028485292] [2020-02-10 20:43:25,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:25,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:25,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:25,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:25,654 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:43:25,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:25,823 INFO L93 Difference]: Finished difference Result 1400 states and 4911 transitions. [2020-02-10 20:43:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:25,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:25,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:25,826 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 20:43:25,826 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:43:25,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-02-10 20:43:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:43:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-02-10 20:43:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:43:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-02-10 20:43:25,850 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-02-10 20:43:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:25,850 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-02-10 20:43:25,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-02-10 20:43:25,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:25,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:25,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-02-10 20:43:25,852 INFO L427 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-02-10 20:43:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:25,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1854686233, now seen corresponding path program 285 times [2020-02-10 20:43:25,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:25,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186375339] [2020-02-10 20:43:25,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:26,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186375339] [2020-02-10 20:43:26,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:26,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:26,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722380070] [2020-02-10 20:43:26,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:26,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:26,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:26,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:26,258 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:43:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:26,415 INFO L93 Difference]: Finished difference Result 1413 states and 4939 transitions. [2020-02-10 20:43:26,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:26,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:26,419 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 20:43:26,419 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:43:26,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-02-10 20:43:26,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:43:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 795. [2020-02-10 20:43:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:43:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-02-10 20:43:26,444 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-02-10 20:43:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:26,444 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-02-10 20:43:26,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-02-10 20:43:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:26,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:26,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-02-10 20:43:26,445 INFO L427 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-02-10 20:43:26,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:26,446 INFO L82 PathProgramCache]: Analyzing trace with hash -291484527, now seen corresponding path program 286 times [2020-02-10 20:43:26,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:26,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079140014] [2020-02-10 20:43:26,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:26,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079140014] [2020-02-10 20:43:26,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:26,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:26,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401929248] [2020-02-10 20:43:26,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:26,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:26,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:26,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:26,852 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:43:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:26,971 INFO L93 Difference]: Finished difference Result 1416 states and 4938 transitions. [2020-02-10 20:43:26,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:26,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:26,975 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:43:26,975 INFO L226 Difference]: Without dead ends: 1391 [2020-02-10 20:43:26,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-02-10 20:43:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-02-10 20:43:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 788. [2020-02-10 20:43:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:43:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 20:43:26,999 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 20:43:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:26,999 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 20:43:26,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 20:43:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:27,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:27,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:27,000 INFO L427 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-02-10 20:43:27,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:27,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1865189337, now seen corresponding path program 287 times [2020-02-10 20:43:27,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:27,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843173496] [2020-02-10 20:43:27,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:27,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843173496] [2020-02-10 20:43:27,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:27,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:27,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778917447] [2020-02-10 20:43:27,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:27,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:27,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:27,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:27,404 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:43:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:27,580 INFO L93 Difference]: Finished difference Result 1404 states and 4914 transitions. [2020-02-10 20:43:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:27,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:27,585 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 20:43:27,585 INFO L226 Difference]: Without dead ends: 1392 [2020-02-10 20:43:27,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-02-10 20:43:27,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-02-10 20:43:27,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 792. [2020-02-10 20:43:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:43:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 20:43:27,609 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 20:43:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:27,609 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 20:43:27,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 20:43:27,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:27,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:27,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-02-10 20:43:27,610 INFO L427 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-02-10 20:43:27,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:27,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1891922381, now seen corresponding path program 288 times [2020-02-10 20:43:27,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:27,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147682888] [2020-02-10 20:43:27,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:28,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-02-10 20:43:28,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147682888] [2020-02-10 20:43:28,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:28,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:28,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584871507] [2020-02-10 20:43:28,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:28,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:28,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:28,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:28,013 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:43:28,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:28,161 INFO L93 Difference]: Finished difference Result 1410 states and 4922 transitions. [2020-02-10 20:43:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:28,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:28,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:28,166 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 20:43:28,166 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:43:28,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-02-10 20:43:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:43:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 780. [2020-02-10 20:43:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:43:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3120 transitions. [2020-02-10 20:43:28,189 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3120 transitions. Word has length 25 [2020-02-10 20:43:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:28,190 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3120 transitions. [2020-02-10 20:43:28,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3120 transitions. [2020-02-10 20:43:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:28,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:28,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-02-10 20:43:28,191 INFO L427 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-02-10 20:43:28,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:28,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1954716373, now seen corresponding path program 289 times [2020-02-10 20:43:28,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:28,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765713473] [2020-02-10 20:43:28,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:28,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765713473] [2020-02-10 20:43:28,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:28,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:28,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77901231] [2020-02-10 20:43:28,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:28,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:28,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:28,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:28,596 INFO L87 Difference]: Start difference. First operand 780 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:43:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:28,770 INFO L93 Difference]: Finished difference Result 1411 states and 4963 transitions. [2020-02-10 20:43:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:28,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:28,774 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:43:28,774 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:43:28,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:43:28,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 20:43:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:43:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-02-10 20:43:28,806 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-02-10 20:43:28,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:28,807 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-02-10 20:43:28,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:28,807 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-02-10 20:43:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:28,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:28,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-02-10 20:43:28,808 INFO L427 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-02-10 20:43:28,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:28,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1369999309, now seen corresponding path program 290 times [2020-02-10 20:43:28,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:28,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14500235] [2020-02-10 20:43:28,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:29,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14500235] [2020-02-10 20:43:29,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:29,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:29,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812256099] [2020-02-10 20:43:29,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:29,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:29,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:29,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:29,210 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:43:29,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:29,369 INFO L93 Difference]: Finished difference Result 1413 states and 4963 transitions. [2020-02-10 20:43:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:29,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:29,372 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 20:43:29,373 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:43:29,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:29,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:43:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 20:43:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:43:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-02-10 20:43:29,397 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-02-10 20:43:29,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:29,397 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-02-10 20:43:29,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-02-10 20:43:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:29,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:29,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-02-10 20:43:29,398 INFO L427 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-02-10 20:43:29,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:29,399 INFO L82 PathProgramCache]: Analyzing trace with hash -857115985, now seen corresponding path program 291 times [2020-02-10 20:43:29,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:29,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486717068] [2020-02-10 20:43:29,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:29,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486717068] [2020-02-10 20:43:29,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:29,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:29,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621048409] [2020-02-10 20:43:29,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:29,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:29,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:29,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:29,813 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:43:29,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:29,987 INFO L93 Difference]: Finished difference Result 1410 states and 4957 transitions. [2020-02-10 20:43:29,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:29,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:29,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:29,991 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 20:43:29,991 INFO L226 Difference]: Without dead ends: 1397 [2020-02-10 20:43:29,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-02-10 20:43:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 793. [2020-02-10 20:43:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:43:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-02-10 20:43:30,015 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-02-10 20:43:30,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:30,015 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-02-10 20:43:30,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-02-10 20:43:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:30,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:30,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-02-10 20:43:30,016 INFO L427 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-02-10 20:43:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:30,017 INFO L82 PathProgramCache]: Analyzing trace with hash 144644941, now seen corresponding path program 292 times [2020-02-10 20:43:30,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:30,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542889038] [2020-02-10 20:43:30,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:30,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542889038] [2020-02-10 20:43:30,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:30,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:30,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489900665] [2020-02-10 20:43:30,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:30,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:30,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:30,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:30,427 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:43:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:30,605 INFO L93 Difference]: Finished difference Result 1411 states and 4955 transitions. [2020-02-10 20:43:30,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:30,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:30,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:30,609 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:43:30,609 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:43:30,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:43:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-02-10 20:43:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:43:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3150 transitions. [2020-02-10 20:43:30,642 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3150 transitions. Word has length 25 [2020-02-10 20:43:30,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:30,642 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3150 transitions. [2020-02-10 20:43:30,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3150 transitions. [2020-02-10 20:43:30,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:30,643 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43: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-02-10 20:43:30,643 INFO L427 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-02-10 20:43:30,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:30,644 INFO L82 PathProgramCache]: Analyzing trace with hash -380181675, now seen corresponding path program 293 times [2020-02-10 20:43:30,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:30,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569492056] [2020-02-10 20:43:30,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:31,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569492056] [2020-02-10 20:43:31,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:31,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:31,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867364777] [2020-02-10 20:43:31,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:31,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:31,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:31,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:31,049 INFO L87 Difference]: Start difference. First operand 789 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:43:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:31,184 INFO L93 Difference]: Finished difference Result 1415 states and 4964 transitions. [2020-02-10 20:43:31,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:31,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:31,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:31,188 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 20:43:31,189 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 20:43:31,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 20:43:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 794. [2020-02-10 20:43:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:43:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3159 transitions. [2020-02-10 20:43:31,214 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3159 transitions. Word has length 25 [2020-02-10 20:43:31,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:31,214 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3159 transitions. [2020-02-10 20:43:31,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3159 transitions. [2020-02-10 20:43:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:31,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:31,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-02-10 20:43:31,215 INFO L427 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-02-10 20:43:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:31,216 INFO L82 PathProgramCache]: Analyzing trace with hash 157673903, now seen corresponding path program 294 times [2020-02-10 20:43:31,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:31,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157045710] [2020-02-10 20:43:31,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:31,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157045710] [2020-02-10 20:43:31,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:31,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:31,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439384685] [2020-02-10 20:43:31,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:31,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:31,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:31,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:31,632 INFO L87 Difference]: Start difference. First operand 794 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:43:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:31,819 INFO L93 Difference]: Finished difference Result 1414 states and 4957 transitions. [2020-02-10 20:43:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:31,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:31,822 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:43:31,823 INFO L226 Difference]: Without dead ends: 1391 [2020-02-10 20:43:31,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-02-10 20:43:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-02-10 20:43:31,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 785. [2020-02-10 20:43:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:43:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3139 transitions. [2020-02-10 20:43:31,846 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3139 transitions. Word has length 25 [2020-02-10 20:43:31,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:31,846 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3139 transitions. [2020-02-10 20:43:31,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3139 transitions. [2020-02-10 20:43:31,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:31,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:31,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-02-10 20:43:31,847 INFO L427 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-02-10 20:43:31,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:31,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1532230647, now seen corresponding path program 295 times [2020-02-10 20:43:31,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:31,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581984413] [2020-02-10 20:43:31,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:32,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581984413] [2020-02-10 20:43:32,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:32,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:32,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900175783] [2020-02-10 20:43:32,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:32,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:32,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:32,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:32,253 INFO L87 Difference]: Start difference. First operand 785 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:43:32,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:32,428 INFO L93 Difference]: Finished difference Result 1419 states and 4976 transitions. [2020-02-10 20:43:32,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:32,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:32,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:32,432 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:43:32,432 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:43:32,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-02-10 20:43:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:43:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 20:43:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:43:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-02-10 20:43:32,456 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-02-10 20:43:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:32,456 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-02-10 20:43:32,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-02-10 20:43:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:32,457 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:32,457 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:32,457 INFO L427 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-02-10 20:43:32,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:32,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1792485035, now seen corresponding path program 296 times [2020-02-10 20:43:32,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:32,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040074032] [2020-02-10 20:43:32,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:32,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040074032] [2020-02-10 20:43:32,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:32,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:32,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240321901] [2020-02-10 20:43:32,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:32,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:32,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:32,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:32,860 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:43:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:33,023 INFO L93 Difference]: Finished difference Result 1421 states and 4976 transitions. [2020-02-10 20:43:33,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:33,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:33,027 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:43:33,027 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:43:33,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-02-10 20:43:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:43:33,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-02-10 20:43:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:43:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3153 transitions. [2020-02-10 20:43:33,052 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3153 transitions. Word has length 25 [2020-02-10 20:43:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:33,052 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3153 transitions. [2020-02-10 20:43:33,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3153 transitions. [2020-02-10 20:43:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:33,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:33,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-02-10 20:43:33,053 INFO L427 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-02-10 20:43:33,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:33,054 INFO L82 PathProgramCache]: Analyzing trace with hash 646432367, now seen corresponding path program 297 times [2020-02-10 20:43:33,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:33,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739774733] [2020-02-10 20:43:33,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:33,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739774733] [2020-02-10 20:43:33,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:33,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:33,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306995544] [2020-02-10 20:43:33,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:33,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:33,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:33,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:33,486 INFO L87 Difference]: Start difference. First operand 790 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:43:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:33,659 INFO L93 Difference]: Finished difference Result 1423 states and 4979 transitions. [2020-02-10 20:43:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:33,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:33,663 INFO L225 Difference]: With dead ends: 1423 [2020-02-10 20:43:33,663 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:43:33,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:43:33,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 795. [2020-02-10 20:43:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:43:33,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3162 transitions. [2020-02-10 20:43:33,687 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3162 transitions. Word has length 25 [2020-02-10 20:43:33,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:33,687 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3162 transitions. [2020-02-10 20:43:33,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:33,687 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3162 transitions. [2020-02-10 20:43:33,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:33,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:33,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-02-10 20:43:33,688 INFO L427 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-02-10 20:43:33,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:33,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1658696397, now seen corresponding path program 298 times [2020-02-10 20:43:33,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:33,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655476272] [2020-02-10 20:43:33,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:34,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655476272] [2020-02-10 20:43:34,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:34,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:34,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296206773] [2020-02-10 20:43:34,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:34,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:34,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:34,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:34,099 INFO L87 Difference]: Start difference. First operand 795 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:43:34,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:34,243 INFO L93 Difference]: Finished difference Result 1428 states and 4984 transitions. [2020-02-10 20:43:34,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:34,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:34,247 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:43:34,248 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 20:43:34,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-02-10 20:43:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 20:43:34,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 790. [2020-02-10 20:43:34,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:43:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-02-10 20:43:34,276 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-02-10 20:43:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:34,276 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-02-10 20:43:34,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-02-10 20:43:34,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:34,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:34,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-02-10 20:43:34,277 INFO L427 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-02-10 20:43:34,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:34,277 INFO L82 PathProgramCache]: Analyzing trace with hash -477071177, now seen corresponding path program 299 times [2020-02-10 20:43:34,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:34,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357876942] [2020-02-10 20:43:34,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:34,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357876942] [2020-02-10 20:43:34,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:34,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:34,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390998084] [2020-02-10 20:43:34,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:34,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:34,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:34,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:34,684 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:43:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:34,841 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-02-10 20:43:34,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:34,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:34,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:34,845 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:43:34,845 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 20:43:34,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 20:43:34,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 797. [2020-02-10 20:43:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:43:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-02-10 20:43:34,870 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-02-10 20:43:34,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:34,870 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-02-10 20:43:34,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-02-10 20:43:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:34,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:34,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-02-10 20:43:34,871 INFO L427 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-02-10 20:43:34,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:34,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1671725359, now seen corresponding path program 300 times [2020-02-10 20:43:34,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:34,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196457205] [2020-02-10 20:43:34,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:35,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196457205] [2020-02-10 20:43:35,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:35,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:35,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672720110] [2020-02-10 20:43:35,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:35,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:35,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:35,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:35,282 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:43:35,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:35,413 INFO L93 Difference]: Finished difference Result 1432 states and 4987 transitions. [2020-02-10 20:43:35,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:35,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:35,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:35,418 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:43:35,418 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:43:35,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-02-10 20:43:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:43:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 785. [2020-02-10 20:43:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:43:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3134 transitions. [2020-02-10 20:43:35,442 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3134 transitions. Word has length 25 [2020-02-10 20:43:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:35,443 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3134 transitions. [2020-02-10 20:43:35,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3134 transitions. [2020-02-10 20:43:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:35,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:35,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-02-10 20:43:35,444 INFO L427 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-02-10 20:43:35,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1747908407, now seen corresponding path program 301 times [2020-02-10 20:43:35,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:35,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485449733] [2020-02-10 20:43:35,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:35,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:35,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485449733] [2020-02-10 20:43:35,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:35,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:35,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601172498] [2020-02-10 20:43:35,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:35,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:35,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:35,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:35,861 INFO L87 Difference]: Start difference. First operand 785 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:43:36,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:36,028 INFO L93 Difference]: Finished difference Result 1416 states and 4964 transitions. [2020-02-10 20:43:36,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:36,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:36,033 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:43:36,033 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:43:36,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:43:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 794. [2020-02-10 20:43:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:43:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3159 transitions. [2020-02-10 20:43:36,057 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3159 transitions. Word has length 25 [2020-02-10 20:43:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:36,057 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3159 transitions. [2020-02-10 20:43:36,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3159 transitions. [2020-02-10 20:43:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:36,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43: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-02-10 20:43:36,058 INFO L427 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-02-10 20:43:36,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:36,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1545297963, now seen corresponding path program 302 times [2020-02-10 20:43:36,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:36,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576222545] [2020-02-10 20:43:36,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:36,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576222545] [2020-02-10 20:43:36,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:36,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:36,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171548050] [2020-02-10 20:43:36,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:36,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:36,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:36,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:36,458 INFO L87 Difference]: Start difference. First operand 794 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:43:36,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:36,605 INFO L93 Difference]: Finished difference Result 1417 states and 4962 transitions. [2020-02-10 20:43:36,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:36,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:36,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:36,610 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 20:43:36,610 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:43:36,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:36,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:43:36,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-02-10 20:43:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:43:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-02-10 20:43:36,634 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-02-10 20:43:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:36,635 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-02-10 20:43:36,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-02-10 20:43:36,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:36,636 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:36,636 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:36,636 INFO L427 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-02-10 20:43:36,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:36,636 INFO L82 PathProgramCache]: Analyzing trace with hash -621024811, now seen corresponding path program 303 times [2020-02-10 20:43:36,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:36,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214374971] [2020-02-10 20:43:36,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:37,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214374971] [2020-02-10 20:43:37,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:37,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:37,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707753764] [2020-02-10 20:43:37,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:37,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:37,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:37,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:37,043 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:43:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:37,184 INFO L93 Difference]: Finished difference Result 1421 states and 4969 transitions. [2020-02-10 20:43:37,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:37,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:37,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:37,189 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:43:37,189 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 20:43:37,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 20:43:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 795. [2020-02-10 20:43:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:43:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3157 transitions. [2020-02-10 20:43:37,224 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3157 transitions. Word has length 25 [2020-02-10 20:43:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:37,224 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3157 transitions. [2020-02-10 20:43:37,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3157 transitions. [2020-02-10 20:43:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:37,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:37,225 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:37,225 INFO L427 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-02-10 20:43:37,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:37,225 INFO L82 PathProgramCache]: Analyzing trace with hash 391239219, now seen corresponding path program 304 times [2020-02-10 20:43:37,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:37,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132682783] [2020-02-10 20:43:37,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:37,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132682783] [2020-02-10 20:43:37,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:37,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:37,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509091570] [2020-02-10 20:43:37,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:37,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:37,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:37,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:37,635 INFO L87 Difference]: Start difference. First operand 795 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:43:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:37,759 INFO L93 Difference]: Finished difference Result 1426 states and 4974 transitions. [2020-02-10 20:43:37,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:37,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:37,764 INFO L225 Difference]: With dead ends: 1426 [2020-02-10 20:43:37,764 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:43:37,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-02-10 20:43:37,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:43:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-02-10 20:43:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:43:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3143 transitions. [2020-02-10 20:43:37,788 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3143 transitions. Word has length 25 [2020-02-10 20:43:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:37,788 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3143 transitions. [2020-02-10 20:43:37,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:37,788 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3143 transitions. [2020-02-10 20:43:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:37,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:37,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-02-10 20:43:37,789 INFO L427 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-02-10 20:43:37,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:37,790 INFO L82 PathProgramCache]: Analyzing trace with hash -229884105, now seen corresponding path program 305 times [2020-02-10 20:43:37,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:37,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111771992] [2020-02-10 20:43:37,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:38,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111771992] [2020-02-10 20:43:38,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:38,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:38,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082304224] [2020-02-10 20:43:38,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:38,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:38,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:38,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:38,186 INFO L87 Difference]: Start difference. First operand 790 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:43:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:38,383 INFO L93 Difference]: Finished difference Result 1424 states and 4971 transitions. [2020-02-10 20:43:38,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:38,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:38,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:38,386 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 20:43:38,386 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:43:38,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-02-10 20:43:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:43:38,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 796. [2020-02-10 20:43:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:43:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3154 transitions. [2020-02-10 20:43:38,410 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3154 transitions. Word has length 25 [2020-02-10 20:43:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:38,411 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3154 transitions. [2020-02-10 20:43:38,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:38,411 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3154 transitions. [2020-02-10 20:43:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:38,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:38,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-02-10 20:43:38,412 INFO L427 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-02-10 20:43:38,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:38,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1381056853, now seen corresponding path program 306 times [2020-02-10 20:43:38,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:38,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729360548] [2020-02-10 20:43:38,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:38,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729360548] [2020-02-10 20:43:38,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:38,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:38,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206502125] [2020-02-10 20:43:38,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:38,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:38,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:38,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:38,825 INFO L87 Difference]: Start difference. First operand 796 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:43:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:38,970 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-02-10 20:43:38,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:38,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:38,974 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:43:38,974 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:43:38,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-02-10 20:43:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:43:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 785. [2020-02-10 20:43:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:43:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3129 transitions. [2020-02-10 20:43:38,998 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3129 transitions. Word has length 25 [2020-02-10 20:43:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:38,998 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3129 transitions. [2020-02-10 20:43:38,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3129 transitions. [2020-02-10 20:43:38,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:38,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:38,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-02-10 20:43:38,999 INFO L427 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-02-10 20:43:39,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:39,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1742942259, now seen corresponding path program 307 times [2020-02-10 20:43:39,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:39,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732903922] [2020-02-10 20:43:39,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:39,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732903922] [2020-02-10 20:43:39,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:39,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:39,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385824618] [2020-02-10 20:43:39,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:39,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:39,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:39,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:39,410 INFO L87 Difference]: Start difference. First operand 785 states and 3129 transitions. Second operand 10 states. [2020-02-10 20:43:39,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:39,553 INFO L93 Difference]: Finished difference Result 1427 states and 4987 transitions. [2020-02-10 20:43:39,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:39,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:39,557 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 20:43:39,557 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:43:39,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:39,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:43:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 796. [2020-02-10 20:43:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:43:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3160 transitions. [2020-02-10 20:43:39,582 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3160 transitions. Word has length 25 [2020-02-10 20:43:39,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:39,582 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3160 transitions. [2020-02-10 20:43:39,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3160 transitions. [2020-02-10 20:43:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:39,583 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:39,583 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:39,583 INFO L427 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-02-10 20:43:39,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:39,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2014169459, now seen corresponding path program 308 times [2020-02-10 20:43:39,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:39,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949293626] [2020-02-10 20:43:39,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:39,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949293626] [2020-02-10 20:43:39,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:39,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:39,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38742737] [2020-02-10 20:43:39,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:39,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:39,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:39,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:39,993 INFO L87 Difference]: Start difference. First operand 796 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:43:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:40,183 INFO L93 Difference]: Finished difference Result 1426 states and 4980 transitions. [2020-02-10 20:43:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:40,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:40,187 INFO L225 Difference]: With dead ends: 1426 [2020-02-10 20:43:40,187 INFO L226 Difference]: Without dead ends: 1407 [2020-02-10 20:43:40,187 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:40,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-02-10 20:43:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 791. [2020-02-10 20:43:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:43:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-02-10 20:43:40,212 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-02-10 20:43:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:40,212 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-02-10 20:43:40,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-02-10 20:43:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:40,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:40,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:40,213 INFO L427 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-02-10 20:43:40,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:40,214 INFO L82 PathProgramCache]: Analyzing trace with hash 142504405, now seen corresponding path program 309 times [2020-02-10 20:43:40,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:40,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832686323] [2020-02-10 20:43:40,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:40,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832686323] [2020-02-10 20:43:40,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:40,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:40,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098946305] [2020-02-10 20:43:40,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:40,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:40,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:40,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:40,631 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:43:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:40,813 INFO L93 Difference]: Finished difference Result 1433 states and 4994 transitions. [2020-02-10 20:43:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:40,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:40,817 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 20:43:40,817 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:43:40,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:43:40,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 798. [2020-02-10 20:43:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:43:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3159 transitions. [2020-02-10 20:43:40,841 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3159 transitions. Word has length 25 [2020-02-10 20:43:40,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:40,842 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3159 transitions. [2020-02-10 20:43:40,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3159 transitions. [2020-02-10 20:43:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:40,843 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:40,843 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:40,843 INFO L427 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-02-10 20:43:40,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:40,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2003666355, now seen corresponding path program 310 times [2020-02-10 20:43:40,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:40,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158074422] [2020-02-10 20:43:40,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:41,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158074422] [2020-02-10 20:43:41,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:41,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:41,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871345829] [2020-02-10 20:43:41,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:41,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:41,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:41,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:41,267 INFO L87 Difference]: Start difference. First operand 798 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:43:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:41,441 INFO L93 Difference]: Finished difference Result 1436 states and 4993 transitions. [2020-02-10 20:43:41,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:41,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:41,445 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 20:43:41,445 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 20:43:41,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 20:43:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 791. [2020-02-10 20:43:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:43:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3140 transitions. [2020-02-10 20:43:41,469 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3140 transitions. Word has length 25 [2020-02-10 20:43:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:41,469 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3140 transitions. [2020-02-10 20:43:41,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3140 transitions. [2020-02-10 20:43:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:41,470 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:41,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-02-10 20:43:41,470 INFO L427 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-02-10 20:43:41,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:41,470 INFO L82 PathProgramCache]: Analyzing trace with hash 174013717, now seen corresponding path program 311 times [2020-02-10 20:43:41,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:41,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798705234] [2020-02-10 20:43:41,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:41,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798705234] [2020-02-10 20:43:41,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:41,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:41,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957660649] [2020-02-10 20:43:41,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:41,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:41,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:41,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:41,883 INFO L87 Difference]: Start difference. First operand 791 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:43:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:42,082 INFO L93 Difference]: Finished difference Result 1430 states and 4981 transitions. [2020-02-10 20:43:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:42,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:42,086 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 20:43:42,086 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:43:42,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:43:42,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 797. [2020-02-10 20:43:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:43:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3151 transitions. [2020-02-10 20:43:42,110 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3151 transitions. Word has length 25 [2020-02-10 20:43:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:42,110 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3151 transitions. [2020-02-10 20:43:42,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3151 transitions. [2020-02-10 20:43:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:42,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:42,111 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:42,111 INFO L427 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-02-10 20:43:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1784954675, now seen corresponding path program 312 times [2020-02-10 20:43:42,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:42,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240711174] [2020-02-10 20:43:42,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:42,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240711174] [2020-02-10 20:43:42,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:42,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:42,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302984375] [2020-02-10 20:43:42,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:42,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:42,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:42,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:42,540 INFO L87 Difference]: Start difference. First operand 797 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:43:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:42,711 INFO L93 Difference]: Finished difference Result 1434 states and 4983 transitions. [2020-02-10 20:43:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:42,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:42,716 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:43:42,716 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:43:42,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-02-10 20:43:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:43:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 780. [2020-02-10 20:43:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:43:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3116 transitions. [2020-02-10 20:43:42,740 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3116 transitions. Word has length 25 [2020-02-10 20:43:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:42,740 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3116 transitions. [2020-02-10 20:43:42,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3116 transitions. [2020-02-10 20:43:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:42,742 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:42,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-02-10 20:43:42,742 INFO L427 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-02-10 20:43:42,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:42,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1048858189, now seen corresponding path program 313 times [2020-02-10 20:43:42,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:42,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630047247] [2020-02-10 20:43:42,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:43,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630047247] [2020-02-10 20:43:43,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:43,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:43,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737310709] [2020-02-10 20:43:43,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:43,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:43,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:43,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:43,154 INFO L87 Difference]: Start difference. First operand 780 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:43:43,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:43,349 INFO L93 Difference]: Finished difference Result 1386 states and 4886 transitions. [2020-02-10 20:43:43,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:43,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:43,353 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 20:43:43,353 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 20:43:43,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:43,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 20:43:43,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 790. [2020-02-10 20:43:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:43:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-02-10 20:43:43,377 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-02-10 20:43:43,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:43,377 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-02-10 20:43:43,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-02-10 20:43:43,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:43,378 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:43,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-02-10 20:43:43,379 INFO L427 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-02-10 20:43:43,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:43,379 INFO L82 PathProgramCache]: Analyzing trace with hash -68103471, now seen corresponding path program 314 times [2020-02-10 20:43:43,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:43,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667076272] [2020-02-10 20:43:43,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:43,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667076272] [2020-02-10 20:43:43,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:43,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:43,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690236928] [2020-02-10 20:43:43,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:43,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:43,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:43,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:43,785 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:43:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:43,977 INFO L93 Difference]: Finished difference Result 1385 states and 4881 transitions. [2020-02-10 20:43:43,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:43,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:43,981 INFO L225 Difference]: With dead ends: 1385 [2020-02-10 20:43:43,982 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 20:43:43,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-02-10 20:43:43,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 20:43:44,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-02-10 20:43:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:43:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3142 transitions. [2020-02-10 20:43:44,005 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3142 transitions. Word has length 25 [2020-02-10 20:43:44,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:44,005 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3142 transitions. [2020-02-10 20:43:44,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3142 transitions. [2020-02-10 20:43:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:44,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:44,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-02-10 20:43:44,007 INFO L427 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-02-10 20:43:44,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:44,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1491757329, now seen corresponding path program 315 times [2020-02-10 20:43:44,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:44,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637035079] [2020-02-10 20:43:44,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:44,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637035079] [2020-02-10 20:43:44,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:44,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:44,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599383259] [2020-02-10 20:43:44,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:44,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:44,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:44,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:44,409 INFO L87 Difference]: Start difference. First operand 787 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:43:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:44,556 INFO L93 Difference]: Finished difference Result 1389 states and 4890 transitions. [2020-02-10 20:43:44,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:44,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:44,559 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 20:43:44,559 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:43:44,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-02-10 20:43:44,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:43:44,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 791. [2020-02-10 20:43:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:43:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3149 transitions. [2020-02-10 20:43:44,583 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3149 transitions. Word has length 25 [2020-02-10 20:43:44,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:44,583 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3149 transitions. [2020-02-10 20:43:44,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3149 transitions. [2020-02-10 20:43:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:44,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:44,585 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:44,585 INFO L427 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-02-10 20:43:44,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:44,585 INFO L82 PathProgramCache]: Analyzing trace with hash -489996403, now seen corresponding path program 316 times [2020-02-10 20:43:44,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:44,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6845363] [2020-02-10 20:43:44,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:44,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6845363] [2020-02-10 20:43:44,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:44,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:44,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20618943] [2020-02-10 20:43:44,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:44,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:44,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:44,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:44,999 INFO L87 Difference]: Start difference. First operand 791 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:43:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:45,201 INFO L93 Difference]: Finished difference Result 1390 states and 4888 transitions. [2020-02-10 20:43:45,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:45,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:45,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:45,205 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:43:45,205 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 20:43:45,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-02-10 20:43:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 20:43:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 787. [2020-02-10 20:43:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:43:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3139 transitions. [2020-02-10 20:43:45,230 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3139 transitions. Word has length 25 [2020-02-10 20:43:45,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:45,230 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3139 transitions. [2020-02-10 20:43:45,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3139 transitions. [2020-02-10 20:43:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:45,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:45,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-02-10 20:43:45,231 INFO L427 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-02-10 20:43:45,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:45,231 INFO L82 PathProgramCache]: Analyzing trace with hash 921714163, now seen corresponding path program 317 times [2020-02-10 20:43:45,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:45,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303173487] [2020-02-10 20:43:45,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:45,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303173487] [2020-02-10 20:43:45,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:45,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:45,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404933095] [2020-02-10 20:43:45,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:45,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:45,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:45,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:45,632 INFO L87 Difference]: Start difference. First operand 787 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:43:45,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:45,819 INFO L93 Difference]: Finished difference Result 1386 states and 4880 transitions. [2020-02-10 20:43:45,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:45,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:45,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:45,823 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 20:43:45,823 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 20:43:45,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-02-10 20:43:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 20:43:45,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 790. [2020-02-10 20:43:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:43:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3144 transitions. [2020-02-10 20:43:45,847 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3144 transitions. Word has length 25 [2020-02-10 20:43:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:45,847 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3144 transitions. [2020-02-10 20:43:45,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3144 transitions. [2020-02-10 20:43:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:45,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:45,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-02-10 20:43:45,849 INFO L427 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-02-10 20:43:45,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:45,849 INFO L82 PathProgramCache]: Analyzing trace with hash -151371217, now seen corresponding path program 318 times [2020-02-10 20:43:45,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:45,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908592499] [2020-02-10 20:43:45,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:46,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908592499] [2020-02-10 20:43:46,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:46,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:46,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947149805] [2020-02-10 20:43:46,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:46,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:46,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:46,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:46,256 INFO L87 Difference]: Start difference. First operand 790 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:43:46,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:46,444 INFO L93 Difference]: Finished difference Result 1388 states and 4881 transitions. [2020-02-10 20:43:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:46,445 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:46,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:46,448 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 20:43:46,449 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:43:46,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:43:46,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 784. [2020-02-10 20:43:46,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:43:46,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3131 transitions. [2020-02-10 20:43:46,472 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3131 transitions. Word has length 25 [2020-02-10 20:43:46,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:46,472 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3131 transitions. [2020-02-10 20:43:46,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:46,473 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3131 transitions. [2020-02-10 20:43:46,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:46,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:46,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:46,474 INFO L427 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-02-10 20:43:46,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:46,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1471343915, now seen corresponding path program 319 times [2020-02-10 20:43:46,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:46,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903719761] [2020-02-10 20:43:46,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:46,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903719761] [2020-02-10 20:43:46,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:46,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:46,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308127180] [2020-02-10 20:43:46,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:46,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:46,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:46,889 INFO L87 Difference]: Start difference. First operand 784 states and 3131 transitions. Second operand 10 states. [2020-02-10 20:43:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:47,055 INFO L93 Difference]: Finished difference Result 1393 states and 4897 transitions. [2020-02-10 20:43:47,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:47,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:47,059 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 20:43:47,059 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:43:47,059 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:43:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 791. [2020-02-10 20:43:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:43:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-02-10 20:43:47,083 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-02-10 20:43:47,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:47,083 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-02-10 20:43:47,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:47,083 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-02-10 20:43:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:47,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:47,084 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:47,084 INFO L427 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-02-10 20:43:47,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:47,084 INFO L82 PathProgramCache]: Analyzing trace with hash -490589197, now seen corresponding path program 320 times [2020-02-10 20:43:47,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:47,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374515585] [2020-02-10 20:43:47,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:47,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374515585] [2020-02-10 20:43:47,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:47,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:47,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281736137] [2020-02-10 20:43:47,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:47,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:47,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:47,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:47,491 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:43:47,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:47,688 INFO L93 Difference]: Finished difference Result 1392 states and 4892 transitions. [2020-02-10 20:43:47,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:47,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:47,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:47,692 INFO L225 Difference]: With dead ends: 1392 [2020-02-10 20:43:47,692 INFO L226 Difference]: Without dead ends: 1377 [2020-02-10 20:43:47,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-02-10 20:43:47,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-02-10 20:43:47,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 788. [2020-02-10 20:43:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:43:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-02-10 20:43:47,716 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-02-10 20:43:47,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:47,716 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-02-10 20:43:47,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:47,716 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-02-10 20:43:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:47,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:47,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-02-10 20:43:47,717 INFO L427 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-02-10 20:43:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:47,718 INFO L82 PathProgramCache]: Analyzing trace with hash 11791023, now seen corresponding path program 321 times [2020-02-10 20:43:47,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:47,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540137559] [2020-02-10 20:43:47,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:48,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540137559] [2020-02-10 20:43:48,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:48,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:48,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149769129] [2020-02-10 20:43:48,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:48,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:48,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:48,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:48,118 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:43:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:48,260 INFO L93 Difference]: Finished difference Result 1401 states and 4910 transitions. [2020-02-10 20:43:48,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:48,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:48,265 INFO L225 Difference]: With dead ends: 1401 [2020-02-10 20:43:48,265 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:43:48,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:43:48,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 793. [2020-02-10 20:43:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:43:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3151 transitions. [2020-02-10 20:43:48,289 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3151 transitions. Word has length 25 [2020-02-10 20:43:48,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:48,289 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3151 transitions. [2020-02-10 20:43:48,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:48,289 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3151 transitions. [2020-02-10 20:43:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:48,290 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:48,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-02-10 20:43:48,290 INFO L427 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-02-10 20:43:48,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:48,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1024055053, now seen corresponding path program 322 times [2020-02-10 20:43:48,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:48,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258708061] [2020-02-10 20:43:48,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:48,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258708061] [2020-02-10 20:43:48,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:48,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:48,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202504713] [2020-02-10 20:43:48,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:48,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:48,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:48,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:48,691 INFO L87 Difference]: Start difference. First operand 793 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:43:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:48,858 INFO L93 Difference]: Finished difference Result 1406 states and 4915 transitions. [2020-02-10 20:43:48,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:48,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:48,863 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 20:43:48,863 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:43:48,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-02-10 20:43:48,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:43:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-02-10 20:43:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:43:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 20:43:48,887 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 20:43:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:48,887 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 20:43:48,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 20:43:48,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:48,888 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:48,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:48,888 INFO L427 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-02-10 20:43:48,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:48,888 INFO L82 PathProgramCache]: Analyzing trace with hash 824824661, now seen corresponding path program 323 times [2020-02-10 20:43:48,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:48,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617444370] [2020-02-10 20:43:48,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:49,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617444370] [2020-02-10 20:43:49,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:49,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:49,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072866440] [2020-02-10 20:43:49,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:49,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:49,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:49,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:49,297 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:43:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:49,486 INFO L93 Difference]: Finished difference Result 1398 states and 4899 transitions. [2020-02-10 20:43:49,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:49,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:49,491 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 20:43:49,491 INFO L226 Difference]: Without dead ends: 1386 [2020-02-10 20:43:49,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-02-10 20:43:49,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 792. [2020-02-10 20:43:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:43:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 20:43:49,515 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 20:43:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:49,515 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 20:43:49,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 20:43:49,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:49,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:49,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-02-10 20:43:49,517 INFO L427 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-02-10 20:43:49,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:49,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1362680239, now seen corresponding path program 324 times [2020-02-10 20:43:49,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:49,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455146207] [2020-02-10 20:43:49,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:49,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455146207] [2020-02-10 20:43:49,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:49,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:49,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363144548] [2020-02-10 20:43:49,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:49,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:49,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:49,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:49,924 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:43:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:50,087 INFO L93 Difference]: Finished difference Result 1404 states and 4907 transitions. [2020-02-10 20:43:50,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:50,088 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:50,091 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 20:43:50,092 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 20:43:50,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:50,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 20:43:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 784. [2020-02-10 20:43:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:43:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-02-10 20:43:50,116 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-02-10 20:43:50,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:50,116 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-02-10 20:43:50,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-02-10 20:43:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:50,117 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:50,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-02-10 20:43:50,117 INFO L427 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-02-10 20:43:50,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:50,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1535752789, now seen corresponding path program 325 times [2020-02-10 20:43:50,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:50,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451616330] [2020-02-10 20:43:50,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:50,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451616330] [2020-02-10 20:43:50,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:50,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:50,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927256426] [2020-02-10 20:43:50,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:50,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:50,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:50,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:50,517 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:43:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:50,716 INFO L93 Difference]: Finished difference Result 1402 states and 4917 transitions. [2020-02-10 20:43:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:50,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:50,720 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 20:43:50,720 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:43:50,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:43:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 793. [2020-02-10 20:43:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:43:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-02-10 20:43:50,745 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-02-10 20:43:50,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:50,745 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-02-10 20:43:50,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-02-10 20:43:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:50,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:50,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-02-10 20:43:50,746 INFO L427 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-02-10 20:43:50,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:50,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1757453581, now seen corresponding path program 326 times [2020-02-10 20:43:50,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:50,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387858810] [2020-02-10 20:43:50,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:51,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387858810] [2020-02-10 20:43:51,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:51,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:51,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203078942] [2020-02-10 20:43:51,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:51,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:51,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:51,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:51,151 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:43:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:51,284 INFO L93 Difference]: Finished difference Result 1403 states and 4915 transitions. [2020-02-10 20:43:51,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:51,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:51,288 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:43:51,288 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:43:51,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:51,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:43:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 789. [2020-02-10 20:43:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:43:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3141 transitions. [2020-02-10 20:43:51,312 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3141 transitions. Word has length 25 [2020-02-10 20:43:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:51,312 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3141 transitions. [2020-02-10 20:43:51,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3141 transitions. [2020-02-10 20:43:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:51,314 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:51,314 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:51,314 INFO L427 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-02-10 20:43:51,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:51,314 INFO L82 PathProgramCache]: Analyzing trace with hash -833180429, now seen corresponding path program 327 times [2020-02-10 20:43:51,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:51,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136831968] [2020-02-10 20:43:51,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:51,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136831968] [2020-02-10 20:43:51,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:51,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:51,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111991342] [2020-02-10 20:43:51,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:51,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:51,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:51,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:51,717 INFO L87 Difference]: Start difference. First operand 789 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:43:51,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:51,851 INFO L93 Difference]: Finished difference Result 1407 states and 4922 transitions. [2020-02-10 20:43:51,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:51,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:51,854 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 20:43:51,854 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:43:51,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:43:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 794. [2020-02-10 20:43:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:43:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3150 transitions. [2020-02-10 20:43:51,878 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3150 transitions. Word has length 25 [2020-02-10 20:43:51,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:51,878 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3150 transitions. [2020-02-10 20:43:51,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:51,879 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3150 transitions. [2020-02-10 20:43:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:51,880 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:51,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-02-10 20:43:51,880 INFO L427 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-02-10 20:43:51,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:51,880 INFO L82 PathProgramCache]: Analyzing trace with hash 179083601, now seen corresponding path program 328 times [2020-02-10 20:43:51,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:51,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894806278] [2020-02-10 20:43:51,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:52,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894806278] [2020-02-10 20:43:52,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:52,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:52,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639830677] [2020-02-10 20:43:52,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:52,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:52,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:52,289 INFO L87 Difference]: Start difference. First operand 794 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:43:52,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:52,399 INFO L93 Difference]: Finished difference Result 1412 states and 4927 transitions. [2020-02-10 20:43:52,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:52,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:52,403 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:43:52,403 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:43:52,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:43:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 789. [2020-02-10 20:43:52,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:43:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3136 transitions. [2020-02-10 20:43:52,427 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3136 transitions. Word has length 25 [2020-02-10 20:43:52,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:52,427 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3136 transitions. [2020-02-10 20:43:52,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3136 transitions. [2020-02-10 20:43:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:52,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:52,428 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:52,428 INFO L427 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-02-10 20:43:52,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:52,428 INFO L82 PathProgramCache]: Analyzing trace with hash -442039723, now seen corresponding path program 329 times [2020-02-10 20:43:52,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:52,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678228811] [2020-02-10 20:43:52,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:52,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678228811] [2020-02-10 20:43:52,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:52,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:52,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772585629] [2020-02-10 20:43:52,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:52,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:52,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:52,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:52,826 INFO L87 Difference]: Start difference. First operand 789 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:43:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:52,963 INFO L93 Difference]: Finished difference Result 1410 states and 4924 transitions. [2020-02-10 20:43:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:52,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:52,967 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 20:43:52,967 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:43:52,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:43:52,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 795. [2020-02-10 20:43:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:43:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3147 transitions. [2020-02-10 20:43:52,991 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3147 transitions. Word has length 25 [2020-02-10 20:43:52,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:52,991 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3147 transitions. [2020-02-10 20:43:52,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:52,991 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3147 transitions. [2020-02-10 20:43:52,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:52,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:52,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:52,993 INFO L427 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-02-10 20:43:52,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:52,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1168901235, now seen corresponding path program 330 times [2020-02-10 20:43:52,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:52,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526285362] [2020-02-10 20:43:52,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:53,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526285362] [2020-02-10 20:43:53,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:53,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:53,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497926589] [2020-02-10 20:43:53,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:53,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:53,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:53,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:53,398 INFO L87 Difference]: Start difference. First operand 795 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:43:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:53,509 INFO L93 Difference]: Finished difference Result 1414 states and 4926 transitions. [2020-02-10 20:43:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:53,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:53,513 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:43:53,514 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:43:53,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-02-10 20:43:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:43:53,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 784. [2020-02-10 20:43:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:43:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3123 transitions. [2020-02-10 20:43:53,538 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3123 transitions. Word has length 25 [2020-02-10 20:43:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:53,538 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3123 transitions. [2020-02-10 20:43:53,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3123 transitions. [2020-02-10 20:43:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:53,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:53,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-02-10 20:43:53,539 INFO L427 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-02-10 20:43:53,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:53,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1250129199, now seen corresponding path program 331 times [2020-02-10 20:43:53,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:53,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534307263] [2020-02-10 20:43:53,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:53,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-02-10 20:43:53,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534307263] [2020-02-10 20:43:53,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:53,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:53,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236206438] [2020-02-10 20:43:53,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:53,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:53,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:53,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:53,939 INFO L87 Difference]: Start difference. First operand 784 states and 3123 transitions. Second operand 10 states. [2020-02-10 20:43:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:54,079 INFO L93 Difference]: Finished difference Result 1395 states and 4894 transitions. [2020-02-10 20:43:54,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:54,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:54,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:54,082 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:43:54,083 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:43:54,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:54,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:43:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 791. [2020-02-10 20:43:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:43:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3142 transitions. [2020-02-10 20:43:54,106 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3142 transitions. Word has length 25 [2020-02-10 20:43:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:54,107 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3142 transitions. [2020-02-10 20:43:54,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3142 transitions. [2020-02-10 20:43:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:54,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:54,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-02-10 20:43:54,108 INFO L427 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-02-10 20:43:54,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:54,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1971752717, now seen corresponding path program 332 times [2020-02-10 20:43:54,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:54,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891645810] [2020-02-10 20:43:54,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:54,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891645810] [2020-02-10 20:43:54,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:54,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:54,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932015562] [2020-02-10 20:43:54,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:54,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:54,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:54,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:54,495 INFO L87 Difference]: Start difference. First operand 791 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:43:54,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:54,627 INFO L93 Difference]: Finished difference Result 1397 states and 4895 transitions. [2020-02-10 20:43:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:54,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:54,631 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 20:43:54,632 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:43:54,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-02-10 20:43:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:43:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 788. [2020-02-10 20:43:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:43:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-02-10 20:43:54,656 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-02-10 20:43:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:54,656 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-02-10 20:43:54,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-02-10 20:43:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:54,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:54,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-02-10 20:43:54,658 INFO L427 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-02-10 20:43:54,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:54,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1444400243, now seen corresponding path program 333 times [2020-02-10 20:43:54,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:54,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133705231] [2020-02-10 20:43:54,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:55,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133705231] [2020-02-10 20:43:55,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:55,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:55,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060225997] [2020-02-10 20:43:55,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:55,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:55,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:55,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:55,042 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:43:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:55,177 INFO L93 Difference]: Finished difference Result 1400 states and 4900 transitions. [2020-02-10 20:43:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:55,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:55,181 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 20:43:55,181 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:43:55,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:43:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-02-10 20:43:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:43:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-02-10 20:43:55,205 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-02-10 20:43:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:55,205 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-02-10 20:43:55,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-02-10 20:43:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:55,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:55,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-02-10 20:43:55,206 INFO L427 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-02-10 20:43:55,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:55,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1982255821, now seen corresponding path program 334 times [2020-02-10 20:43:55,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:55,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099810641] [2020-02-10 20:43:55,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:55,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099810641] [2020-02-10 20:43:55,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:55,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:55,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057755815] [2020-02-10 20:43:55,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:55,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:55,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:55,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:55,601 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:43:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:55,711 INFO L93 Difference]: Finished difference Result 1406 states and 4908 transitions. [2020-02-10 20:43:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:55,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:55,714 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 20:43:55,714 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 20:43:55,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:55,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 20:43:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 788. [2020-02-10 20:43:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:43:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3130 transitions. [2020-02-10 20:43:55,738 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3130 transitions. Word has length 25 [2020-02-10 20:43:55,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:55,738 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3130 transitions. [2020-02-10 20:43:55,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3130 transitions. [2020-02-10 20:43:55,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:55,740 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:55,740 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:55,740 INFO L427 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-02-10 20:43:55,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:55,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1465406451, now seen corresponding path program 335 times [2020-02-10 20:43:55,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:55,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627407571] [2020-02-10 20:43:55,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:56,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627407571] [2020-02-10 20:43:56,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:56,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:56,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443409704] [2020-02-10 20:43:56,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:56,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:56,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:56,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:56,140 INFO L87 Difference]: Start difference. First operand 788 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:43:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:56,275 INFO L93 Difference]: Finished difference Result 1406 states and 4910 transitions. [2020-02-10 20:43:56,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:56,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:56,279 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 20:43:56,279 INFO L226 Difference]: Without dead ends: 1392 [2020-02-10 20:43:56,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-02-10 20:43:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 794. [2020-02-10 20:43:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:43:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3141 transitions. [2020-02-10 20:43:56,303 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3141 transitions. Word has length 25 [2020-02-10 20:43:56,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:56,304 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3141 transitions. [2020-02-10 20:43:56,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3141 transitions. [2020-02-10 20:43:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:56,305 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:56,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-02-10 20:43:56,305 INFO L427 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-02-10 20:43:56,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:56,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1218619887, now seen corresponding path program 336 times [2020-02-10 20:43:56,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:56,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566487804] [2020-02-10 20:43:56,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:56,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566487804] [2020-02-10 20:43:56,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:56,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:56,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423616058] [2020-02-10 20:43:56,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:56,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:56,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:56,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:56,718 INFO L87 Difference]: Start difference. First operand 794 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:43:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:56,827 INFO L93 Difference]: Finished difference Result 1410 states and 4912 transitions. [2020-02-10 20:43:56,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:56,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:56,831 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 20:43:56,831 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 20:43:56,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-02-10 20:43:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 20:43:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 780. [2020-02-10 20:43:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:43:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-02-10 20:43:56,855 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-02-10 20:43:56,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:56,855 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-02-10 20:43:56,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:56,855 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-02-10 20:43:56,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:56,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:56,856 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:56,856 INFO L427 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-02-10 20:43:56,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:56,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1832995017, now seen corresponding path program 337 times [2020-02-10 20:43:56,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:56,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389940118] [2020-02-10 20:43:56,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:57,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389940118] [2020-02-10 20:43:57,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:57,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:57,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735238894] [2020-02-10 20:43:57,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:57,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:57,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:57,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:57,252 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:43:57,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:57,385 INFO L93 Difference]: Finished difference Result 1399 states and 4914 transitions. [2020-02-10 20:43:57,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:57,386 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:57,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:57,389 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 20:43:57,389 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 20:43:57,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 20:43:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 790. [2020-02-10 20:43:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:43:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3146 transitions. [2020-02-10 20:43:57,413 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3146 transitions. Word has length 25 [2020-02-10 20:43:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:57,413 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3146 transitions. [2020-02-10 20:43:57,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3146 transitions. [2020-02-10 20:43:57,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:57,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:57,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-02-10 20:43:57,415 INFO L427 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-02-10 20:43:57,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:57,415 INFO L82 PathProgramCache]: Analyzing trace with hash -222054059, now seen corresponding path program 338 times [2020-02-10 20:43:57,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:57,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233975210] [2020-02-10 20:43:57,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:57,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233975210] [2020-02-10 20:43:57,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:57,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:57,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998447358] [2020-02-10 20:43:57,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:57,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:57,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:57,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:57,805 INFO L87 Difference]: Start difference. First operand 790 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:43:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:57,940 INFO L93 Difference]: Finished difference Result 1396 states and 4905 transitions. [2020-02-10 20:43:57,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:57,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:57,944 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 20:43:57,945 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 20:43:57,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-02-10 20:43:57,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 20:43:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 787. [2020-02-10 20:43:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:43:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-02-10 20:43:57,969 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-02-10 20:43:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:57,969 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-02-10 20:43:57,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-02-10 20:43:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:57,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:57,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-02-10 20:43:57,970 INFO L427 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-02-10 20:43:57,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:57,971 INFO L82 PathProgramCache]: Analyzing trace with hash -738903429, now seen corresponding path program 339 times [2020-02-10 20:43:57,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:57,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170525482] [2020-02-10 20:43:57,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:58,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:58,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170525482] [2020-02-10 20:43:58,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:58,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:58,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244049381] [2020-02-10 20:43:58,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:58,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:58,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:58,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:58,365 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:43:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:58,497 INFO L93 Difference]: Finished difference Result 1403 states and 4921 transitions. [2020-02-10 20:43:58,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:58,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:58,501 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:43:58,501 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:43:58,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:43:58,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-02-10 20:43:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:43:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-02-10 20:43:58,525 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-02-10 20:43:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:58,525 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-02-10 20:43:58,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-02-10 20:43:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:58,526 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:58,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-02-10 20:43:58,527 INFO L427 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-02-10 20:43:58,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:58,527 INFO L82 PathProgramCache]: Analyzing trace with hash -201047851, now seen corresponding path program 340 times [2020-02-10 20:43:58,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:58,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091117013] [2020-02-10 20:43:58,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:58,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-02-10 20:43:58,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091117013] [2020-02-10 20:43:58,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:58,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:58,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872216925] [2020-02-10 20:43:58,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:58,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:58,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:58,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:58,923 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:43:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:59,059 INFO L93 Difference]: Finished difference Result 1402 states and 4914 transitions. [2020-02-10 20:43:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:59,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:59,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:59,062 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 20:43:59,063 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:43:59,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-02-10 20:43:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:43:59,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 787. [2020-02-10 20:43:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:43:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3135 transitions. [2020-02-10 20:43:59,086 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3135 transitions. Word has length 25 [2020-02-10 20:43:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:59,087 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3135 transitions. [2020-02-10 20:43:59,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3135 transitions. [2020-02-10 20:43:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:59,088 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:59,088 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:59,088 INFO L427 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-02-10 20:43:59,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:59,088 INFO L82 PathProgramCache]: Analyzing trace with hash -728400325, now seen corresponding path program 341 times [2020-02-10 20:43:59,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:59,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619688891] [2020-02-10 20:43:59,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:43:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:43:59,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619688891] [2020-02-10 20:43:59,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:43:59,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:43:59,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461250068] [2020-02-10 20:43:59,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:43:59,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:43:59,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:43:59,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:43:59,480 INFO L87 Difference]: Start difference. First operand 787 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:43:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:43:59,607 INFO L93 Difference]: Finished difference Result 1395 states and 4900 transitions. [2020-02-10 20:43:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:43:59,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:43:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:43:59,611 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:43:59,611 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:43:59,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:43:59,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:43:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 790. [2020-02-10 20:43:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:43:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-02-10 20:43:59,635 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-02-10 20:43:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:43:59,635 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-02-10 20:43:59,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:43:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-02-10 20:43:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:43:59,636 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:43:59,636 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:43:59,636 INFO L427 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-02-10 20:43:59,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:43:59,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1801485705, now seen corresponding path program 342 times [2020-02-10 20:43:59,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:43:59,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571702782] [2020-02-10 20:43:59,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:43:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:00,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571702782] [2020-02-10 20:44:00,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:00,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:00,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581356080] [2020-02-10 20:44:00,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:00,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:00,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:00,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:00,032 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:44:00,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:00,182 INFO L93 Difference]: Finished difference Result 1397 states and 4901 transitions. [2020-02-10 20:44:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:00,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:00,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:00,186 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 20:44:00,186 INFO L226 Difference]: Without dead ends: 1377 [2020-02-10 20:44:00,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-02-10 20:44:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-02-10 20:44:00,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 784. [2020-02-10 20:44:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:44:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-02-10 20:44:00,210 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-02-10 20:44:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:00,210 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-02-10 20:44:00,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-02-10 20:44:00,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:00,211 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44: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-02-10 20:44:00,211 INFO L427 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-02-10 20:44:00,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash 93039061, now seen corresponding path program 343 times [2020-02-10 20:44:00,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:00,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103320561] [2020-02-10 20:44:00,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:00,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103320561] [2020-02-10 20:44:00,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:00,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:00,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343176112] [2020-02-10 20:44:00,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:00,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:00,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:00,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:00,618 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:44:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:00,759 INFO L93 Difference]: Finished difference Result 1407 states and 4928 transitions. [2020-02-10 20:44:00,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:00,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:00,763 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 20:44:00,764 INFO L226 Difference]: Without dead ends: 1392 [2020-02-10 20:44:00,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-02-10 20:44:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-02-10 20:44:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 791. [2020-02-10 20:44:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:44:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-02-10 20:44:00,788 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-02-10 20:44:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:00,788 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-02-10 20:44:00,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-02-10 20:44:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:00,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:00,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-02-10 20:44:00,789 INFO L427 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-02-10 20:44:00,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1703980019, now seen corresponding path program 344 times [2020-02-10 20:44:00,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:00,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044605500] [2020-02-10 20:44:00,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:01,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044605500] [2020-02-10 20:44:01,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:01,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:01,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065414330] [2020-02-10 20:44:01,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:01,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:01,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:01,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:01,190 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:44:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:01,322 INFO L93 Difference]: Finished difference Result 1404 states and 4919 transitions. [2020-02-10 20:44:01,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:01,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:01,326 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 20:44:01,326 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:44:01,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-02-10 20:44:01,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:44:01,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 788. [2020-02-10 20:44:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:44:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 20:44:01,350 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 20:44:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:01,350 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 20:44:01,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 20:44:01,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:01,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:01,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-02-10 20:44:01,351 INFO L427 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-02-10 20:44:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:01,351 INFO L82 PathProgramCache]: Analyzing trace with hash -413307205, now seen corresponding path program 345 times [2020-02-10 20:44:01,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:01,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415266434] [2020-02-10 20:44:01,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:01,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415266434] [2020-02-10 20:44:01,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:01,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:01,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076958656] [2020-02-10 20:44:01,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:01,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:01,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:01,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:01,744 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:44:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:01,876 INFO L93 Difference]: Finished difference Result 1417 states and 4947 transitions. [2020-02-10 20:44:01,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:01,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:01,880 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 20:44:01,880 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:44:01,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:44:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 795. [2020-02-10 20:44:01,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:44:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-02-10 20:44:01,904 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-02-10 20:44:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:01,904 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-02-10 20:44:01,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-02-10 20:44:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:01,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:01,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-02-10 20:44:01,905 INFO L427 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-02-10 20:44:01,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:01,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1735489331, now seen corresponding path program 346 times [2020-02-10 20:44:01,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:01,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845664406] [2020-02-10 20:44:01,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:02,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845664406] [2020-02-10 20:44:02,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:02,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:02,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058624565] [2020-02-10 20:44:02,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:02,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:02,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:02,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:02,314 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:44:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:02,422 INFO L93 Difference]: Finished difference Result 1420 states and 4946 transitions. [2020-02-10 20:44:02,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:02,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:02,426 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 20:44:02,426 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 20:44:02,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:02,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 20:44:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 788. [2020-02-10 20:44:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:44:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-02-10 20:44:02,450 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-02-10 20:44:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:02,450 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-02-10 20:44:02,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-02-10 20:44:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:02,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:02,451 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:02,451 INFO L427 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-02-10 20:44:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:02,452 INFO L82 PathProgramCache]: Analyzing trace with hash -402804101, now seen corresponding path program 347 times [2020-02-10 20:44:02,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:02,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976644195] [2020-02-10 20:44:02,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:02,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976644195] [2020-02-10 20:44:02,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:02,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:02,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99825662] [2020-02-10 20:44:02,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:02,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:02,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:02,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:02,853 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:44:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:02,991 INFO L93 Difference]: Finished difference Result 1408 states and 4922 transitions. [2020-02-10 20:44:02,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:02,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:02,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:02,995 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 20:44:02,995 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:44:02,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:44:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-02-10 20:44:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:44:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-02-10 20:44:03,019 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-02-10 20:44:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:03,020 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-02-10 20:44:03,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:03,020 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-02-10 20:44:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:03,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:03,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:03,021 INFO L427 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-02-10 20:44:03,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:03,021 INFO L82 PathProgramCache]: Analyzing trace with hash 135051477, now seen corresponding path program 348 times [2020-02-10 20:44:03,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:03,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479591894] [2020-02-10 20:44:03,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:03,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479591894] [2020-02-10 20:44:03,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:03,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:03,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066462712] [2020-02-10 20:44:03,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:03,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:03,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:03,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:03,436 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:44:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:03,570 INFO L93 Difference]: Finished difference Result 1414 states and 4930 transitions. [2020-02-10 20:44:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:03,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:03,574 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:44:03,574 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:44:03,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:44:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 784. [2020-02-10 20:44:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:44:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3123 transitions. [2020-02-10 20:44:03,598 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3123 transitions. Word has length 25 [2020-02-10 20:44:03,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:03,598 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3123 transitions. [2020-02-10 20:44:03,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3123 transitions. [2020-02-10 20:44:03,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:03,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:03,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-02-10 20:44:03,599 INFO L427 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-02-10 20:44:03,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:03,599 INFO L82 PathProgramCache]: Analyzing trace with hash 744231509, now seen corresponding path program 349 times [2020-02-10 20:44:03,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:03,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817135037] [2020-02-10 20:44:03,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:04,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817135037] [2020-02-10 20:44:04,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:04,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:04,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654654465] [2020-02-10 20:44:04,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:04,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:04,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:04,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:04,009 INFO L87 Difference]: Start difference. First operand 784 states and 3123 transitions. Second operand 10 states. [2020-02-10 20:44:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:04,156 INFO L93 Difference]: Finished difference Result 1419 states and 4958 transitions. [2020-02-10 20:44:04,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:04,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:04,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:04,161 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:44:04,161 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 20:44:04,161 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:04,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 20:44:04,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 795. [2020-02-10 20:44:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:44:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3154 transitions. [2020-02-10 20:44:04,187 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3154 transitions. Word has length 25 [2020-02-10 20:44:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:04,187 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3154 transitions. [2020-02-10 20:44:04,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3154 transitions. [2020-02-10 20:44:04,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:04,189 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:04,189 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:04,189 INFO L427 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-02-10 20:44:04,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:04,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1282087087, now seen corresponding path program 350 times [2020-02-10 20:44:04,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:04,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193980153] [2020-02-10 20:44:04,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:04,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193980153] [2020-02-10 20:44:04,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:04,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:04,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291675211] [2020-02-10 20:44:04,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:04,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:04,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:04,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:04,602 INFO L87 Difference]: Start difference. First operand 795 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:44:04,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:04,774 INFO L93 Difference]: Finished difference Result 1418 states and 4951 transitions. [2020-02-10 20:44:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:04,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:04,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:04,779 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:44:04,779 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:44:04,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:44:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-02-10 20:44:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:44:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-02-10 20:44:04,803 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-02-10 20:44:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:04,803 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-02-10 20:44:04,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-02-10 20:44:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:04,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:04,804 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:04,804 INFO L427 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-02-10 20:44:04,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:04,805 INFO L82 PathProgramCache]: Analyzing trace with hash -856206345, now seen corresponding path program 351 times [2020-02-10 20:44:04,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:04,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820745881] [2020-02-10 20:44:04,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:05,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820745881] [2020-02-10 20:44:05,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:05,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:05,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237524257] [2020-02-10 20:44:05,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:05,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:05,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:05,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:05,206 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:44:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:05,361 INFO L93 Difference]: Finished difference Result 1425 states and 4965 transitions. [2020-02-10 20:44:05,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:05,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:05,365 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 20:44:05,365 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:44:05,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:44:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 797. [2020-02-10 20:44:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:44:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3153 transitions. [2020-02-10 20:44:05,390 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3153 transitions. Word has length 25 [2020-02-10 20:44:05,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:05,390 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3153 transitions. [2020-02-10 20:44:05,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3153 transitions. [2020-02-10 20:44:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:05,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:05,391 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:05,391 INFO L427 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-02-10 20:44:05,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:05,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1292590191, now seen corresponding path program 352 times [2020-02-10 20:44:05,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:05,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211026977] [2020-02-10 20:44:05,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:05,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-02-10 20:44:05,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211026977] [2020-02-10 20:44:05,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:05,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:05,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950292417] [2020-02-10 20:44:05,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:05,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:05,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:05,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:05,793 INFO L87 Difference]: Start difference. First operand 797 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:44:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:05,920 INFO L93 Difference]: Finished difference Result 1428 states and 4964 transitions. [2020-02-10 20:44:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:05,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:05,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:05,924 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:44:05,924 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:44:05,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:44:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-02-10 20:44:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:44:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3134 transitions. [2020-02-10 20:44:05,948 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3134 transitions. Word has length 25 [2020-02-10 20:44:05,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:05,948 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3134 transitions. [2020-02-10 20:44:05,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3134 transitions. [2020-02-10 20:44:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:05,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:05,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:05,949 INFO L427 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-02-10 20:44:05,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:05,949 INFO L82 PathProgramCache]: Analyzing trace with hash -824697033, now seen corresponding path program 353 times [2020-02-10 20:44:05,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:05,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257150693] [2020-02-10 20:44:05,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:06,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257150693] [2020-02-10 20:44:06,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:06,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:06,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706326900] [2020-02-10 20:44:06,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:06,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:06,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:06,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:06,353 INFO L87 Difference]: Start difference. First operand 790 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:44:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:06,488 INFO L93 Difference]: Finished difference Result 1422 states and 4952 transitions. [2020-02-10 20:44:06,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:06,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:06,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:06,492 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:44:06,492 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 20:44:06,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-02-10 20:44:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 20:44:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 796. [2020-02-10 20:44:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:44:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3145 transitions. [2020-02-10 20:44:06,517 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3145 transitions. Word has length 25 [2020-02-10 20:44:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:06,517 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3145 transitions. [2020-02-10 20:44:06,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3145 transitions. [2020-02-10 20:44:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:06,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:06,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-02-10 20:44:06,518 INFO L427 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-02-10 20:44:06,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:06,518 INFO L82 PathProgramCache]: Analyzing trace with hash 786243925, now seen corresponding path program 354 times [2020-02-10 20:44:06,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:06,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762586129] [2020-02-10 20:44:06,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:06,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-02-10 20:44:06,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762586129] [2020-02-10 20:44:06,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:06,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:06,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612156030] [2020-02-10 20:44:06,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:06,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:06,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:06,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:06,924 INFO L87 Difference]: Start difference. First operand 796 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:44:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:07,039 INFO L93 Difference]: Finished difference Result 1426 states and 4954 transitions. [2020-02-10 20:44:07,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:07,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:07,043 INFO L225 Difference]: With dead ends: 1426 [2020-02-10 20:44:07,043 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:44:07,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-02-10 20:44:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:44:07,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 784. [2020-02-10 20:44:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:44:07,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-02-10 20:44:07,067 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-02-10 20:44:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:07,067 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-02-10 20:44:07,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-02-10 20:44:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:07,068 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:07,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-02-10 20:44:07,068 INFO L427 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-02-10 20:44:07,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:07,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1614198605, now seen corresponding path program 355 times [2020-02-10 20:44:07,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:07,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788804694] [2020-02-10 20:44:07,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:07,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788804694] [2020-02-10 20:44:07,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:07,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:07,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499343982] [2020-02-10 20:44:07,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:07,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:07,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:07,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:07,457 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:44:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:07,592 INFO L93 Difference]: Finished difference Result 1401 states and 4907 transitions. [2020-02-10 20:44:07,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:07,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:07,596 INFO L225 Difference]: With dead ends: 1401 [2020-02-10 20:44:07,596 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:44:07,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-02-10 20:44:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:44:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 791. [2020-02-10 20:44:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:44:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3138 transitions. [2020-02-10 20:44:07,620 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3138 transitions. Word has length 25 [2020-02-10 20:44:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:07,620 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3138 transitions. [2020-02-10 20:44:07,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3138 transitions. [2020-02-10 20:44:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:07,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:07,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-02-10 20:44:07,621 INFO L427 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-02-10 20:44:07,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:07,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1607683311, now seen corresponding path program 356 times [2020-02-10 20:44:07,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:07,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585408198] [2020-02-10 20:44:07,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:08,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585408198] [2020-02-10 20:44:08,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:08,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:08,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462635350] [2020-02-10 20:44:08,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:08,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:08,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:08,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:08,012 INFO L87 Difference]: Start difference. First operand 791 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:44:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:08,152 INFO L93 Difference]: Finished difference Result 1403 states and 4908 transitions. [2020-02-10 20:44:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:08,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:08,156 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:44:08,157 INFO L226 Difference]: Without dead ends: 1386 [2020-02-10 20:44:08,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-02-10 20:44:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 788. [2020-02-10 20:44:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:44:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3130 transitions. [2020-02-10 20:44:08,181 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3130 transitions. Word has length 25 [2020-02-10 20:44:08,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:08,181 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3130 transitions. [2020-02-10 20:44:08,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:08,181 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3130 transitions. [2020-02-10 20:44:08,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:08,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:08,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:08,182 INFO L427 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-02-10 20:44:08,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:08,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1080330837, now seen corresponding path program 357 times [2020-02-10 20:44:08,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:08,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756860145] [2020-02-10 20:44:08,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:08,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-02-10 20:44:08,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756860145] [2020-02-10 20:44:08,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:08,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:08,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274445820] [2020-02-10 20:44:08,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:08,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:08,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:08,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:08,582 INFO L87 Difference]: Start difference. First operand 788 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:44:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:08,719 INFO L93 Difference]: Finished difference Result 1406 states and 4913 transitions. [2020-02-10 20:44:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:08,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:08,723 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 20:44:08,723 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:44:08,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:44:08,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 792. [2020-02-10 20:44:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:44:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-02-10 20:44:08,747 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-02-10 20:44:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:08,747 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-02-10 20:44:08,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-02-10 20:44:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:08,748 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:08,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-02-10 20:44:08,748 INFO L427 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-02-10 20:44:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:08,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1618186415, now seen corresponding path program 358 times [2020-02-10 20:44:08,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:08,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471677804] [2020-02-10 20:44:08,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:09,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471677804] [2020-02-10 20:44:09,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:09,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:09,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610852919] [2020-02-10 20:44:09,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:09,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:09,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:09,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:09,144 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:44:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:09,277 INFO L93 Difference]: Finished difference Result 1412 states and 4921 transitions. [2020-02-10 20:44:09,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:09,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:09,281 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:44:09,282 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:44:09,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-02-10 20:44:09,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:44:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 788. [2020-02-10 20:44:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:44:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3126 transitions. [2020-02-10 20:44:09,306 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3126 transitions. Word has length 25 [2020-02-10 20:44:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:09,306 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3126 transitions. [2020-02-10 20:44:09,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3126 transitions. [2020-02-10 20:44:09,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:09,307 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:09,307 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:09,307 INFO L427 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-02-10 20:44:09,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:09,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1101337045, now seen corresponding path program 359 times [2020-02-10 20:44:09,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:09,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793595890] [2020-02-10 20:44:09,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:09,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-02-10 20:44:09,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793595890] [2020-02-10 20:44:09,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:09,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:09,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658434911] [2020-02-10 20:44:09,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:09,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:09,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:09,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:09,693 INFO L87 Difference]: Start difference. First operand 788 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:44:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:09,826 INFO L93 Difference]: Finished difference Result 1412 states and 4923 transitions. [2020-02-10 20:44:09,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:09,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:09,830 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:44:09,831 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:44:09,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-02-10 20:44:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:44:09,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-02-10 20:44:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:44:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-02-10 20:44:09,855 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-02-10 20:44:09,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:09,855 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-02-10 20:44:09,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-02-10 20:44:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:09,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:09,856 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:09,856 INFO L427 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-02-10 20:44:09,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:09,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1582689293, now seen corresponding path program 360 times [2020-02-10 20:44:09,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:09,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380830732] [2020-02-10 20:44:09,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:10,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380830732] [2020-02-10 20:44:10,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:10,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:10,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902751306] [2020-02-10 20:44:10,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:10,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:10,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:10,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:10,252 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:44:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:10,364 INFO L93 Difference]: Finished difference Result 1416 states and 4925 transitions. [2020-02-10 20:44:10,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:10,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:10,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:10,368 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:44:10,368 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:44:10,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-02-10 20:44:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:44:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 776. [2020-02-10 20:44:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:44:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3101 transitions. [2020-02-10 20:44:10,392 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3101 transitions. Word has length 25 [2020-02-10 20:44:10,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:10,392 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3101 transitions. [2020-02-10 20:44:10,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3101 transitions. [2020-02-10 20:44:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:10,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:10,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-02-10 20:44:10,393 INFO L427 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-02-10 20:44:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:10,393 INFO L82 PathProgramCache]: Analyzing trace with hash 519656473, now seen corresponding path program 361 times [2020-02-10 20:44:10,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:10,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860686250] [2020-02-10 20:44:10,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:10,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860686250] [2020-02-10 20:44:10,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:10,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:10,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796468097] [2020-02-10 20:44:10,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:10,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:10,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:10,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:10,783 INFO L87 Difference]: Start difference. First operand 776 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:44:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:10,945 INFO L93 Difference]: Finished difference Result 1450 states and 5092 transitions. [2020-02-10 20:44:10,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:10,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:10,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:10,949 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 20:44:10,950 INFO L226 Difference]: Without dead ends: 1437 [2020-02-10 20:44:10,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-02-10 20:44:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 797. [2020-02-10 20:44:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:44:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3180 transitions. [2020-02-10 20:44:10,974 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3180 transitions. Word has length 25 [2020-02-10 20:44:10,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:10,975 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3180 transitions. [2020-02-10 20:44:10,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3180 transitions. [2020-02-10 20:44:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:10,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:10,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-02-10 20:44:10,976 INFO L427 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-02-10 20:44:10,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:10,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1489908087, now seen corresponding path program 362 times [2020-02-10 20:44:10,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:10,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646802585] [2020-02-10 20:44:10,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:11,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646802585] [2020-02-10 20:44:11,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:11,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:11,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341122363] [2020-02-10 20:44:11,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:11,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:11,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:11,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:11,371 INFO L87 Difference]: Start difference. First operand 797 states and 3180 transitions. Second operand 10 states. [2020-02-10 20:44:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:11,535 INFO L93 Difference]: Finished difference Result 1452 states and 5092 transitions. [2020-02-10 20:44:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:11,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:11,539 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 20:44:11,540 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 20:44:11,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-02-10 20:44:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 20:44:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 793. [2020-02-10 20:44:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:44:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3169 transitions. [2020-02-10 20:44:11,564 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3169 transitions. Word has length 25 [2020-02-10 20:44:11,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:11,564 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3169 transitions. [2020-02-10 20:44:11,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:11,564 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3169 transitions. [2020-02-10 20:44:11,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:11,565 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:11,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:11,566 INFO L427 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-02-10 20:44:11,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:11,566 INFO L82 PathProgramCache]: Analyzing trace with hash 76757333, now seen corresponding path program 363 times [2020-02-10 20:44:11,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:11,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114009930] [2020-02-10 20:44:11,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:11,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114009930] [2020-02-10 20:44:11,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:11,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:11,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041529441] [2020-02-10 20:44:11,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:11,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:11,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:11,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:11,987 INFO L87 Difference]: Start difference. First operand 793 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:44:12,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:12,119 INFO L93 Difference]: Finished difference Result 1451 states and 5090 transitions. [2020-02-10 20:44:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:12,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:12,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:12,123 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 20:44:12,123 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 20:44:12,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-02-10 20:44:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 20:44:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 797. [2020-02-10 20:44:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:44:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3176 transitions. [2020-02-10 20:44:12,147 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3176 transitions. Word has length 25 [2020-02-10 20:44:12,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:12,147 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3176 transitions. [2020-02-10 20:44:12,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3176 transitions. [2020-02-10 20:44:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:12,149 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:12,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:12,149 INFO L427 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-02-10 20:44:12,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:12,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1068015155, now seen corresponding path program 364 times [2020-02-10 20:44:12,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:12,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788624851] [2020-02-10 20:44:12,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:12,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788624851] [2020-02-10 20:44:12,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:12,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:12,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39456678] [2020-02-10 20:44:12,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:12,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:12,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:12,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:12,573 INFO L87 Difference]: Start difference. First operand 797 states and 3176 transitions. Second operand 10 states. [2020-02-10 20:44:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:12,712 INFO L93 Difference]: Finished difference Result 1454 states and 5092 transitions. [2020-02-10 20:44:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:12,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:12,716 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 20:44:12,716 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 20:44:12,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:12,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 20:44:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 793. [2020-02-10 20:44:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:44:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-02-10 20:44:12,741 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-02-10 20:44:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:12,741 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-02-10 20:44:12,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:12,742 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-02-10 20:44:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:12,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:12,743 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:12,743 INFO L427 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-02-10 20:44:12,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:12,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2140837799, now seen corresponding path program 365 times [2020-02-10 20:44:12,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:12,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619061232] [2020-02-10 20:44:12,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:13,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619061232] [2020-02-10 20:44:13,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:13,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:13,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212917929] [2020-02-10 20:44:13,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:13,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:13,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:13,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:13,155 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:44:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:13,295 INFO L93 Difference]: Finished difference Result 1457 states and 5100 transitions. [2020-02-10 20:44:13,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:13,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:13,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:13,299 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:44:13,299 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 20:44:13,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 20:44:13,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 799. [2020-02-10 20:44:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:44:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3176 transitions. [2020-02-10 20:44:13,324 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3176 transitions. Word has length 25 [2020-02-10 20:44:13,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:13,324 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3176 transitions. [2020-02-10 20:44:13,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:13,324 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3176 transitions. [2020-02-10 20:44:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:13,325 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:13,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-02-10 20:44:13,325 INFO L427 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-02-10 20:44:13,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1081044117, now seen corresponding path program 366 times [2020-02-10 20:44:13,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:13,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466343579] [2020-02-10 20:44:13,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:13,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466343579] [2020-02-10 20:44:13,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:13,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:13,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313809854] [2020-02-10 20:44:13,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:13,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:13,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:13,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:13,736 INFO L87 Difference]: Start difference. First operand 799 states and 3176 transitions. Second operand 10 states. [2020-02-10 20:44:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:13,886 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-02-10 20:44:13,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:13,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:13,890 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 20:44:13,890 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:44:13,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:44:13,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 789. [2020-02-10 20:44:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:44:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-02-10 20:44:13,915 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-02-10 20:44:13,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:13,915 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-02-10 20:44:13,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-02-10 20:44:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:13,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:13,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:13,916 INFO L427 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-02-10 20:44:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:13,916 INFO L82 PathProgramCache]: Analyzing trace with hash 97170747, now seen corresponding path program 367 times [2020-02-10 20:44:13,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:13,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140647240] [2020-02-10 20:44:13,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:14,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140647240] [2020-02-10 20:44:14,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:14,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:14,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628211398] [2020-02-10 20:44:14,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:14,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:14,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:14,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:14,319 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:44:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:14,455 INFO L93 Difference]: Finished difference Result 1447 states and 5081 transitions. [2020-02-10 20:44:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:14,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:14,460 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:44:14,460 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 20:44:14,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 20:44:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-02-10 20:44:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:44:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3176 transitions. [2020-02-10 20:44:14,484 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3176 transitions. Word has length 25 [2020-02-10 20:44:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:14,484 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3176 transitions. [2020-02-10 20:44:14,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3176 transitions. [2020-02-10 20:44:14,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:14,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:14,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-02-10 20:44:14,486 INFO L427 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-02-10 20:44:14,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:14,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1067422361, now seen corresponding path program 368 times [2020-02-10 20:44:14,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:14,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716967634] [2020-02-10 20:44:14,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:14,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716967634] [2020-02-10 20:44:14,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:14,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:14,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88281870] [2020-02-10 20:44:14,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:14,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:14,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:14,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:14,893 INFO L87 Difference]: Start difference. First operand 797 states and 3176 transitions. Second operand 10 states. [2020-02-10 20:44:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:15,025 INFO L93 Difference]: Finished difference Result 1449 states and 5081 transitions. [2020-02-10 20:44:15,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:15,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:15,030 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:44:15,030 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 20:44:15,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-02-10 20:44:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 20:44:15,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-02-10 20:44:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:44:15,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-02-10 20:44:15,054 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-02-10 20:44:15,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:15,054 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-02-10 20:44:15,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:15,055 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-02-10 20:44:15,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:15,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:15,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-02-10 20:44:15,056 INFO L427 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-02-10 20:44:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:15,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1580305685, now seen corresponding path program 369 times [2020-02-10 20:44:15,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:15,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859291142] [2020-02-10 20:44:15,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:15,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859291142] [2020-02-10 20:44:15,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:15,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:15,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414056894] [2020-02-10 20:44:15,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:15,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:15,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:15,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:15,463 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:44:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:15,618 INFO L93 Difference]: Finished difference Result 1446 states and 5075 transitions. [2020-02-10 20:44:15,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:15,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:15,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:15,621 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 20:44:15,621 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 20:44:15,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-02-10 20:44:15,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 20:44:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 797. [2020-02-10 20:44:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:44:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3172 transitions. [2020-02-10 20:44:15,646 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3172 transitions. Word has length 25 [2020-02-10 20:44:15,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:15,646 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3172 transitions. [2020-02-10 20:44:15,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3172 transitions. [2020-02-10 20:44:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:15,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:15,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-02-10 20:44:15,648 INFO L427 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-02-10 20:44:15,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:15,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1712900685, now seen corresponding path program 370 times [2020-02-10 20:44:15,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:15,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851189659] [2020-02-10 20:44:15,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:16,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851189659] [2020-02-10 20:44:16,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:16,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:16,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607458558] [2020-02-10 20:44:16,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:16,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:16,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:16,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:16,072 INFO L87 Difference]: Start difference. First operand 797 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:44:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:16,218 INFO L93 Difference]: Finished difference Result 1447 states and 5073 transitions. [2020-02-10 20:44:16,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:16,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:16,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:16,222 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:44:16,222 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 20:44:16,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:16,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 20:44:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 793. [2020-02-10 20:44:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:44:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-02-10 20:44:16,246 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-02-10 20:44:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:16,246 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-02-10 20:44:16,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-02-10 20:44:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:16,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:16,248 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:16,248 INFO L427 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-02-10 20:44:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2057239995, now seen corresponding path program 371 times [2020-02-10 20:44:16,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:16,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176186531] [2020-02-10 20:44:16,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:16,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176186531] [2020-02-10 20:44:16,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:16,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:16,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332843826] [2020-02-10 20:44:16,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:16,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:16,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:16,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:16,659 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:44:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:16,811 INFO L93 Difference]: Finished difference Result 1451 states and 5082 transitions. [2020-02-10 20:44:16,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:16,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:16,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:16,814 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 20:44:16,814 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:44:16,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:44:16,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 798. [2020-02-10 20:44:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:44:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3170 transitions. [2020-02-10 20:44:16,839 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3170 transitions. Word has length 25 [2020-02-10 20:44:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:16,839 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3170 transitions. [2020-02-10 20:44:16,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3170 transitions. [2020-02-10 20:44:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:16,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:16,840 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:16,840 INFO L427 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-02-10 20:44:16,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:16,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1699871723, now seen corresponding path program 372 times [2020-02-10 20:44:16,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:16,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844550252] [2020-02-10 20:44:16,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:17,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844550252] [2020-02-10 20:44:17,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:17,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:17,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219967773] [2020-02-10 20:44:17,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:17,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:17,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:17,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:17,252 INFO L87 Difference]: Start difference. First operand 798 states and 3170 transitions. Second operand 10 states. [2020-02-10 20:44:17,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:17,400 INFO L93 Difference]: Finished difference Result 1450 states and 5075 transitions. [2020-02-10 20:44:17,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:17,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:17,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:17,404 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 20:44:17,404 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 20:44:17,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 20:44:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2020-02-10 20:44:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:44:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3150 transitions. [2020-02-10 20:44:17,428 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3150 transitions. Word has length 25 [2020-02-10 20:44:17,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:17,429 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3150 transitions. [2020-02-10 20:44:17,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3150 transitions. [2020-02-10 20:44:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:17,430 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:17,430 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:17,430 INFO L427 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-02-10 20:44:17,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:17,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1190699845, now seen corresponding path program 373 times [2020-02-10 20:44:17,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:17,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45025419] [2020-02-10 20:44:17,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:17,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45025419] [2020-02-10 20:44:17,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:17,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:17,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631265042] [2020-02-10 20:44:17,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:17,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:17,832 INFO L87 Difference]: Start difference. First operand 789 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:44:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:17,975 INFO L93 Difference]: Finished difference Result 1449 states and 5081 transitions. [2020-02-10 20:44:17,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:17,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:17,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:17,980 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:44:17,980 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:44:17,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:17,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:44:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 797. [2020-02-10 20:44:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:44:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3172 transitions. [2020-02-10 20:44:18,004 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3172 transitions. Word has length 25 [2020-02-10 20:44:18,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:18,005 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3172 transitions. [2020-02-10 20:44:18,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3172 transitions. [2020-02-10 20:44:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:18,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44: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-02-10 20:44:18,006 INFO L427 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-02-10 20:44:18,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:18,006 INFO L82 PathProgramCache]: Analyzing trace with hash -199442023, now seen corresponding path program 374 times [2020-02-10 20:44:18,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:18,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920944546] [2020-02-10 20:44:18,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:18,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920944546] [2020-02-10 20:44:18,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:18,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:18,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258427935] [2020-02-10 20:44:18,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:18,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:18,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:18,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:18,412 INFO L87 Difference]: Start difference. First operand 797 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:44:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:18,568 INFO L93 Difference]: Finished difference Result 1452 states and 5083 transitions. [2020-02-10 20:44:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:18,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:18,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:18,572 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 20:44:18,572 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:44:18,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:44:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 793. [2020-02-10 20:44:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:44:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-02-10 20:44:18,596 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-02-10 20:44:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:18,597 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-02-10 20:44:18,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-02-10 20:44:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:18,598 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44: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-02-10 20:44:18,598 INFO L427 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-02-10 20:44:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash 735334233, now seen corresponding path program 375 times [2020-02-10 20:44:18,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:18,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403868330] [2020-02-10 20:44:18,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:19,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403868330] [2020-02-10 20:44:19,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:19,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:19,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821755347] [2020-02-10 20:44:19,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:19,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:19,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:19,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:19,007 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:44:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:19,143 INFO L93 Difference]: Finished difference Result 1447 states and 5073 transitions. [2020-02-10 20:44:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:19,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:19,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:19,147 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:44:19,147 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 20:44:19,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 20:44:19,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-02-10 20:44:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:44:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-02-10 20:44:19,171 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-02-10 20:44:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:19,172 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-02-10 20:44:19,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-02-10 20:44:19,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:19,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:19,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-02-10 20:44:19,173 INFO L427 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-02-10 20:44:19,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:19,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1737095159, now seen corresponding path program 376 times [2020-02-10 20:44:19,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:19,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232771766] [2020-02-10 20:44:19,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:19,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232771766] [2020-02-10 20:44:19,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:19,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:19,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39937524] [2020-02-10 20:44:19,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:19,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:19,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:19,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:19,589 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:44:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:19,730 INFO L93 Difference]: Finished difference Result 1448 states and 5071 transitions. [2020-02-10 20:44:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:19,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:19,734 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 20:44:19,734 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 20:44:19,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:19,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 20:44:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-02-10 20:44:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:44:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-02-10 20:44:19,758 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-02-10 20:44:19,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:19,758 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-02-10 20:44:19,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-02-10 20:44:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:19,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:19,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-02-10 20:44:19,760 INFO L427 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-02-10 20:44:19,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:19,761 INFO L82 PathProgramCache]: Analyzing trace with hash 790375611, now seen corresponding path program 377 times [2020-02-10 20:44:19,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:19,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838470737] [2020-02-10 20:44:19,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:20,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838470737] [2020-02-10 20:44:20,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:20,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:20,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371453364] [2020-02-10 20:44:20,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:20,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:20,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:20,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:20,184 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:44:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:20,346 INFO L93 Difference]: Finished difference Result 1454 states and 5084 transitions. [2020-02-10 20:44:20,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:20,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:20,351 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 20:44:20,351 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 20:44:20,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-02-10 20:44:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 20:44:20,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 798. [2020-02-10 20:44:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:44:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3166 transitions. [2020-02-10 20:44:20,378 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3166 transitions. Word has length 25 [2020-02-10 20:44:20,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:20,378 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3166 transitions. [2020-02-10 20:44:20,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3166 transitions. [2020-02-10 20:44:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:20,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:20,380 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:20,380 INFO L427 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-02-10 20:44:20,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:20,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1893650727, now seen corresponding path program 378 times [2020-02-10 20:44:20,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:20,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75856212] [2020-02-10 20:44:20,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:20,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75856212] [2020-02-10 20:44:20,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:20,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:20,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381867295] [2020-02-10 20:44:20,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:20,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:20,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:20,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:20,780 INFO L87 Difference]: Start difference. First operand 798 states and 3166 transitions. Second operand 10 states. [2020-02-10 20:44:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:20,924 INFO L93 Difference]: Finished difference Result 1452 states and 5075 transitions. [2020-02-10 20:44:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:20,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:20,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:20,928 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 20:44:20,928 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 20:44:20,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-02-10 20:44:20,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 20:44:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 789. [2020-02-10 20:44:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:44:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3146 transitions. [2020-02-10 20:44:20,954 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3146 transitions. Word has length 25 [2020-02-10 20:44:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:20,955 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3146 transitions. [2020-02-10 20:44:20,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3146 transitions. [2020-02-10 20:44:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:20,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:20,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-02-10 20:44:20,956 INFO L427 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-02-10 20:44:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:20,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1521262217, now seen corresponding path program 379 times [2020-02-10 20:44:20,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:20,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491043566] [2020-02-10 20:44:20,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:21,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491043566] [2020-02-10 20:44:21,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:21,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:21,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074365637] [2020-02-10 20:44:21,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:21,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:21,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:21,363 INFO L87 Difference]: Start difference. First operand 789 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:44:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:21,494 INFO L93 Difference]: Finished difference Result 1461 states and 5108 transitions. [2020-02-10 20:44:21,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:21,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:21,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:21,499 INFO L225 Difference]: With dead ends: 1461 [2020-02-10 20:44:21,499 INFO L226 Difference]: Without dead ends: 1446 [2020-02-10 20:44:21,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-02-10 20:44:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-02-10 20:44:21,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 800. [2020-02-10 20:44:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:44:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3176 transitions. [2020-02-10 20:44:21,524 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3176 transitions. Word has length 25 [2020-02-10 20:44:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:21,525 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3176 transitions. [2020-02-10 20:44:21,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3176 transitions. [2020-02-10 20:44:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:21,526 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:21,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:21,526 INFO L427 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-02-10 20:44:21,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:21,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1700619699, now seen corresponding path program 380 times [2020-02-10 20:44:21,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:21,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080318987] [2020-02-10 20:44:21,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:21,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080318987] [2020-02-10 20:44:21,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:21,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:21,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418561683] [2020-02-10 20:44:21,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:21,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:21,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:21,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:21,943 INFO L87 Difference]: Start difference. First operand 800 states and 3176 transitions. Second operand 10 states. [2020-02-10 20:44:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:22,075 INFO L93 Difference]: Finished difference Result 1462 states and 5104 transitions. [2020-02-10 20:44:22,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:22,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:22,079 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 20:44:22,079 INFO L226 Difference]: Without dead ends: 1440 [2020-02-10 20:44:22,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-02-10 20:44:22,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 794. [2020-02-10 20:44:22,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:44:22,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3160 transitions. [2020-02-10 20:44:22,104 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3160 transitions. Word has length 25 [2020-02-10 20:44:22,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:22,104 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3160 transitions. [2020-02-10 20:44:22,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:22,104 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3160 transitions. [2020-02-10 20:44:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:22,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:22,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-02-10 20:44:22,105 INFO L427 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-02-10 20:44:22,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:22,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1173267225, now seen corresponding path program 381 times [2020-02-10 20:44:22,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:22,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684900201] [2020-02-10 20:44:22,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:22,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684900201] [2020-02-10 20:44:22,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:22,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:22,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140810074] [2020-02-10 20:44:22,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:22,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:22,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:22,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:22,518 INFO L87 Difference]: Start difference. First operand 794 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:44:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:22,656 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-02-10 20:44:22,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:22,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:22,659 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 20:44:22,660 INFO L226 Difference]: Without dead ends: 1443 [2020-02-10 20:44:22,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-02-10 20:44:22,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 799. [2020-02-10 20:44:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:44:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3169 transitions. [2020-02-10 20:44:22,684 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3169 transitions. Word has length 25 [2020-02-10 20:44:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:22,684 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3169 transitions. [2020-02-10 20:44:22,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3169 transitions. [2020-02-10 20:44:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:22,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:22,686 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:22,686 INFO L427 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-02-10 20:44:22,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:22,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1711122803, now seen corresponding path program 382 times [2020-02-10 20:44:22,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:22,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001992350] [2020-02-10 20:44:22,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:23,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001992350] [2020-02-10 20:44:23,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:23,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:23,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529782295] [2020-02-10 20:44:23,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:23,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:23,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:23,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:23,095 INFO L87 Difference]: Start difference. First operand 799 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:44:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:23,233 INFO L93 Difference]: Finished difference Result 1457 states and 5089 transitions. [2020-02-10 20:44:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:23,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:23,237 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:44:23,237 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 20:44:23,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-02-10 20:44:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 20:44:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 794. [2020-02-10 20:44:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:44:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3155 transitions. [2020-02-10 20:44:23,261 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3155 transitions. Word has length 25 [2020-02-10 20:44:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:23,261 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3155 transitions. [2020-02-10 20:44:23,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3155 transitions. [2020-02-10 20:44:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:23,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:23,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-02-10 20:44:23,263 INFO L427 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-02-10 20:44:23,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:23,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1194273433, now seen corresponding path program 383 times [2020-02-10 20:44:23,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:23,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662880457] [2020-02-10 20:44:23,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:23,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662880457] [2020-02-10 20:44:23,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:23,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:23,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87480159] [2020-02-10 20:44:23,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:23,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:23,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:23,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:23,666 INFO L87 Difference]: Start difference. First operand 794 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:44:23,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:23,797 INFO L93 Difference]: Finished difference Result 1460 states and 5095 transitions. [2020-02-10 20:44:23,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:23,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:23,802 INFO L225 Difference]: With dead ends: 1460 [2020-02-10 20:44:23,802 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:44:23,802 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:44:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 799. [2020-02-10 20:44:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:44:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3164 transitions. [2020-02-10 20:44:23,826 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3164 transitions. Word has length 25 [2020-02-10 20:44:23,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:23,826 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3164 transitions. [2020-02-10 20:44:23,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3164 transitions. [2020-02-10 20:44:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:23,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:23,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-02-10 20:44:23,828 INFO L427 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-02-10 20:44:23,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:23,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1489752905, now seen corresponding path program 384 times [2020-02-10 20:44:23,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:23,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500861564] [2020-02-10 20:44:23,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:24,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500861564] [2020-02-10 20:44:24,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:24,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:24,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673030304] [2020-02-10 20:44:24,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:24,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:24,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:24,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:24,248 INFO L87 Difference]: Start difference. First operand 799 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:44:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:24,386 INFO L93 Difference]: Finished difference Result 1458 states and 5086 transitions. [2020-02-10 20:44:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:24,386 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:24,390 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 20:44:24,390 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 20:44:24,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 20:44:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 785. [2020-02-10 20:44:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:44:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-02-10 20:44:24,414 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-02-10 20:44:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:24,414 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-02-10 20:44:24,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-02-10 20:44:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:24,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:24,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-02-10 20:44:24,416 INFO L427 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-02-10 20:44:24,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:24,416 INFO L82 PathProgramCache]: Analyzing trace with hash 307500855, now seen corresponding path program 385 times [2020-02-10 20:44:24,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:24,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692855125] [2020-02-10 20:44:24,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:24,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:24,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692855125] [2020-02-10 20:44:24,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:24,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:24,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142891524] [2020-02-10 20:44:24,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:24,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:24,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:24,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:24,817 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:44:24,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:24,956 INFO L93 Difference]: Finished difference Result 1471 states and 5138 transitions. [2020-02-10 20:44:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:24,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:24,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:24,960 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 20:44:24,960 INFO L226 Difference]: Without dead ends: 1458 [2020-02-10 20:44:24,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2020-02-10 20:44:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 800. [2020-02-10 20:44:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:44:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3185 transitions. [2020-02-10 20:44:24,985 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3185 transitions. Word has length 25 [2020-02-10 20:44:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:24,985 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3185 transitions. [2020-02-10 20:44:24,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3185 transitions. [2020-02-10 20:44:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:24,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:24,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-02-10 20:44:24,986 INFO L427 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-02-10 20:44:24,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:24,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1277752469, now seen corresponding path program 386 times [2020-02-10 20:44:24,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:24,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684804453] [2020-02-10 20:44:24,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:25,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684804453] [2020-02-10 20:44:25,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:25,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:25,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537713051] [2020-02-10 20:44:25,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:25,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:25,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:25,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:25,386 INFO L87 Difference]: Start difference. First operand 800 states and 3185 transitions. Second operand 10 states. [2020-02-10 20:44:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:25,529 INFO L93 Difference]: Finished difference Result 1473 states and 5138 transitions. [2020-02-10 20:44:25,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:25,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:25,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:25,533 INFO L225 Difference]: With dead ends: 1473 [2020-02-10 20:44:25,533 INFO L226 Difference]: Without dead ends: 1454 [2020-02-10 20:44:25,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-02-10 20:44:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 796. [2020-02-10 20:44:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:44:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3174 transitions. [2020-02-10 20:44:25,557 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3174 transitions. Word has length 25 [2020-02-10 20:44:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:25,557 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3174 transitions. [2020-02-10 20:44:25,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3174 transitions. [2020-02-10 20:44:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:25,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:25,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-02-10 20:44:25,559 INFO L427 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-02-10 20:44:25,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:25,559 INFO L82 PathProgramCache]: Analyzing trace with hash -135398285, now seen corresponding path program 387 times [2020-02-10 20:44:25,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:25,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847860735] [2020-02-10 20:44:25,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:25,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847860735] [2020-02-10 20:44:25,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:25,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:25,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562612917] [2020-02-10 20:44:25,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:25,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:25,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:25,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:25,967 INFO L87 Difference]: Start difference. First operand 796 states and 3174 transitions. Second operand 10 states. [2020-02-10 20:44:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:26,107 INFO L93 Difference]: Finished difference Result 1472 states and 5136 transitions. [2020-02-10 20:44:26,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:26,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:26,111 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 20:44:26,112 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 20:44:26,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 20:44:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 800. [2020-02-10 20:44:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:44:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3181 transitions. [2020-02-10 20:44:26,136 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3181 transitions. Word has length 25 [2020-02-10 20:44:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:26,136 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3181 transitions. [2020-02-10 20:44:26,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3181 transitions. [2020-02-10 20:44:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:26,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:26,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-02-10 20:44:26,137 INFO L427 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-02-10 20:44:26,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:26,137 INFO L82 PathProgramCache]: Analyzing trace with hash 855859537, now seen corresponding path program 388 times [2020-02-10 20:44:26,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:26,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529953757] [2020-02-10 20:44:26,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:26,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529953757] [2020-02-10 20:44:26,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:26,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:26,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695952367] [2020-02-10 20:44:26,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:26,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:26,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:26,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:26,578 INFO L87 Difference]: Start difference. First operand 800 states and 3181 transitions. Second operand 10 states. [2020-02-10 20:44:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:26,724 INFO L93 Difference]: Finished difference Result 1475 states and 5138 transitions. [2020-02-10 20:44:26,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:26,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:26,728 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 20:44:26,729 INFO L226 Difference]: Without dead ends: 1455 [2020-02-10 20:44:26,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:26,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-02-10 20:44:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 796. [2020-02-10 20:44:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:44:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3170 transitions. [2020-02-10 20:44:26,754 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3170 transitions. Word has length 25 [2020-02-10 20:44:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:26,754 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3170 transitions. [2020-02-10 20:44:26,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3170 transitions. [2020-02-10 20:44:26,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:26,755 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:26,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-02-10 20:44:26,755 INFO L427 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-02-10 20:44:26,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:26,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1941973879, now seen corresponding path program 389 times [2020-02-10 20:44:26,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:26,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164482733] [2020-02-10 20:44:26,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:27,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164482733] [2020-02-10 20:44:27,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:27,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:27,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867435531] [2020-02-10 20:44:27,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:27,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:27,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:27,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:27,163 INFO L87 Difference]: Start difference. First operand 796 states and 3170 transitions. Second operand 10 states. [2020-02-10 20:44:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:27,298 INFO L93 Difference]: Finished difference Result 1478 states and 5146 transitions. [2020-02-10 20:44:27,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:27,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:27,303 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 20:44:27,303 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 20:44:27,303 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:27,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 20:44:27,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 802. [2020-02-10 20:44:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:44:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3181 transitions. [2020-02-10 20:44:27,327 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3181 transitions. Word has length 25 [2020-02-10 20:44:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:27,327 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3181 transitions. [2020-02-10 20:44:27,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:27,327 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3181 transitions. [2020-02-10 20:44:27,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:27,328 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:27,328 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:27,329 INFO L427 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-02-10 20:44:27,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:27,329 INFO L82 PathProgramCache]: Analyzing trace with hash 868888499, now seen corresponding path program 390 times [2020-02-10 20:44:27,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:27,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834591077] [2020-02-10 20:44:27,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:27,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834591077] [2020-02-10 20:44:27,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:27,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:27,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358452525] [2020-02-10 20:44:27,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:27,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:27,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:27,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:27,738 INFO L87 Difference]: Start difference. First operand 802 states and 3181 transitions. Second operand 10 states. [2020-02-10 20:44:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:27,896 INFO L93 Difference]: Finished difference Result 1479 states and 5142 transitions. [2020-02-10 20:44:27,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:27,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:27,899 INFO L225 Difference]: With dead ends: 1479 [2020-02-10 20:44:27,900 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 20:44:27,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:27,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 20:44:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 792. [2020-02-10 20:44:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:44:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3159 transitions. [2020-02-10 20:44:27,924 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3159 transitions. Word has length 25 [2020-02-10 20:44:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:27,924 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3159 transitions. [2020-02-10 20:44:27,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3159 transitions. [2020-02-10 20:44:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:27,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:27,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-02-10 20:44:27,926 INFO L427 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-02-10 20:44:27,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:27,926 INFO L82 PathProgramCache]: Analyzing trace with hash -537470597, now seen corresponding path program 391 times [2020-02-10 20:44:27,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:27,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839766900] [2020-02-10 20:44:27,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:28,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839766900] [2020-02-10 20:44:28,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:28,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:28,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613739094] [2020-02-10 20:44:28,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:28,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:28,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:28,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:28,342 INFO L87 Difference]: Start difference. First operand 792 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:44:28,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:28,494 INFO L93 Difference]: Finished difference Result 1476 states and 5144 transitions. [2020-02-10 20:44:28,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:28,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:28,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:28,499 INFO L225 Difference]: With dead ends: 1476 [2020-02-10 20:44:28,499 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 20:44:28,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-02-10 20:44:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 20:44:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 801. [2020-02-10 20:44:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:44:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3184 transitions. [2020-02-10 20:44:28,523 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3184 transitions. Word has length 25 [2020-02-10 20:44:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:28,524 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3184 transitions. [2020-02-10 20:44:28,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3184 transitions. [2020-02-10 20:44:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:28,525 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:28,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-02-10 20:44:28,527 INFO L427 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-02-10 20:44:28,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:28,527 INFO L82 PathProgramCache]: Analyzing trace with hash 432781017, now seen corresponding path program 392 times [2020-02-10 20:44:28,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:28,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539484807] [2020-02-10 20:44:28,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:28,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-02-10 20:44:28,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539484807] [2020-02-10 20:44:28,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:28,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:28,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761617003] [2020-02-10 20:44:28,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:28,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:28,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:28,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:28,923 INFO L87 Difference]: Start difference. First operand 801 states and 3184 transitions. Second operand 10 states. [2020-02-10 20:44:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:29,068 INFO L93 Difference]: Finished difference Result 1478 states and 5144 transitions. [2020-02-10 20:44:29,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:29,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:29,072 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 20:44:29,073 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 20:44:29,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:29,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 20:44:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 797. [2020-02-10 20:44:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:44:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3173 transitions. [2020-02-10 20:44:29,097 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3173 transitions. Word has length 25 [2020-02-10 20:44:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:29,097 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3173 transitions. [2020-02-10 20:44:29,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:29,097 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3173 transitions. [2020-02-10 20:44:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:29,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44: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-02-10 20:44:29,098 INFO L427 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-02-10 20:44:29,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:29,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1423268877, now seen corresponding path program 393 times [2020-02-10 20:44:29,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:29,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940794467] [2020-02-10 20:44:29,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:29,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940794467] [2020-02-10 20:44:29,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:29,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:29,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467683140] [2020-02-10 20:44:29,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:29,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:29,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:29,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:29,511 INFO L87 Difference]: Start difference. First operand 797 states and 3173 transitions. Second operand 10 states. [2020-02-10 20:44:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:29,680 INFO L93 Difference]: Finished difference Result 1480 states and 5147 transitions. [2020-02-10 20:44:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:29,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:29,684 INFO L225 Difference]: With dead ends: 1480 [2020-02-10 20:44:29,684 INFO L226 Difference]: Without dead ends: 1467 [2020-02-10 20:44:29,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:29,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-02-10 20:44:29,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 802. [2020-02-10 20:44:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:44:29,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3182 transitions. [2020-02-10 20:44:29,709 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3182 transitions. Word has length 25 [2020-02-10 20:44:29,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:29,709 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3182 transitions. [2020-02-10 20:44:29,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3182 transitions. [2020-02-10 20:44:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:29,710 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:29,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-02-10 20:44:29,710 INFO L427 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-02-10 20:44:29,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:29,710 INFO L82 PathProgramCache]: Analyzing trace with hash -411004847, now seen corresponding path program 394 times [2020-02-10 20:44:29,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:29,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708609777] [2020-02-10 20:44:29,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:30,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708609777] [2020-02-10 20:44:30,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:30,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:30,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088244184] [2020-02-10 20:44:30,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:30,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:30,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:30,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:30,129 INFO L87 Difference]: Start difference. First operand 802 states and 3182 transitions. Second operand 10 states. [2020-02-10 20:44:30,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:30,247 INFO L93 Difference]: Finished difference Result 1485 states and 5152 transitions. [2020-02-10 20:44:30,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:30,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:30,251 INFO L225 Difference]: With dead ends: 1485 [2020-02-10 20:44:30,251 INFO L226 Difference]: Without dead ends: 1462 [2020-02-10 20:44:30,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-02-10 20:44:30,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 797. [2020-02-10 20:44:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:44:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-02-10 20:44:30,275 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-02-10 20:44:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:30,276 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-02-10 20:44:30,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-02-10 20:44:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:30,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:30,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-02-10 20:44:30,277 INFO L427 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-02-10 20:44:30,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:30,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1748194875, now seen corresponding path program 395 times [2020-02-10 20:44:30,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:30,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402618206] [2020-02-10 20:44:30,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:30,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:30,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402618206] [2020-02-10 20:44:30,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:30,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:30,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955786667] [2020-02-10 20:44:30,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:30,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:30,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:30,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:30,686 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:44:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:30,842 INFO L93 Difference]: Finished difference Result 1486 states and 5156 transitions. [2020-02-10 20:44:30,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:30,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:30,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:30,846 INFO L225 Difference]: With dead ends: 1486 [2020-02-10 20:44:30,846 INFO L226 Difference]: Without dead ends: 1471 [2020-02-10 20:44:30,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-02-10 20:44:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 804. [2020-02-10 20:44:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:44:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3181 transitions. [2020-02-10 20:44:30,870 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3181 transitions. Word has length 25 [2020-02-10 20:44:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:30,870 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3181 transitions. [2020-02-10 20:44:30,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3181 transitions. [2020-02-10 20:44:30,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:30,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:30,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-02-10 20:44:30,871 INFO L427 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-02-10 20:44:30,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:30,871 INFO L82 PathProgramCache]: Analyzing trace with hash -397975885, now seen corresponding path program 396 times [2020-02-10 20:44:30,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:30,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818948282] [2020-02-10 20:44:30,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:31,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818948282] [2020-02-10 20:44:31,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:31,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:31,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026934696] [2020-02-10 20:44:31,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:31,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:31,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:31,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:31,300 INFO L87 Difference]: Start difference. First operand 804 states and 3181 transitions. Second operand 10 states. [2020-02-10 20:44:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:31,462 INFO L93 Difference]: Finished difference Result 1489 states and 5155 transitions. [2020-02-10 20:44:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:31,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:31,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:31,466 INFO L225 Difference]: With dead ends: 1489 [2020-02-10 20:44:31,466 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 20:44:31,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-02-10 20:44:31,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 20:44:31,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 792. [2020-02-10 20:44:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:44:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3154 transitions. [2020-02-10 20:44:31,491 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3154 transitions. Word has length 25 [2020-02-10 20:44:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:31,491 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3154 transitions. [2020-02-10 20:44:31,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3154 transitions. [2020-02-10 20:44:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:31,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:31,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-02-10 20:44:31,493 INFO L427 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-02-10 20:44:31,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:31,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1825341189, now seen corresponding path program 397 times [2020-02-10 20:44:31,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:31,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918415223] [2020-02-10 20:44:31,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:31,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918415223] [2020-02-10 20:44:31,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:31,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:31,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528602678] [2020-02-10 20:44:31,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:31,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:31,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:31,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:31,908 INFO L87 Difference]: Start difference. First operand 792 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:44:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:32,054 INFO L93 Difference]: Finished difference Result 1481 states and 5149 transitions. [2020-02-10 20:44:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:32,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:32,058 INFO L225 Difference]: With dead ends: 1481 [2020-02-10 20:44:32,058 INFO L226 Difference]: Without dead ends: 1468 [2020-02-10 20:44:32,059 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:32,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-02-10 20:44:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 802. [2020-02-10 20:44:32,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:44:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3181 transitions. [2020-02-10 20:44:32,083 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3181 transitions. Word has length 25 [2020-02-10 20:44:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:32,083 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3181 transitions. [2020-02-10 20:44:32,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3181 transitions. [2020-02-10 20:44:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:32,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:32,084 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:32,084 INFO L427 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-02-10 20:44:32,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:32,084 INFO L82 PathProgramCache]: Analyzing trace with hash -834083367, now seen corresponding path program 398 times [2020-02-10 20:44:32,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:32,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262596454] [2020-02-10 20:44:32,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:32,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262596454] [2020-02-10 20:44:32,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:32,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:32,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694055140] [2020-02-10 20:44:32,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:32,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:32,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:32,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:32,503 INFO L87 Difference]: Start difference. First operand 802 states and 3181 transitions. Second operand 10 states. [2020-02-10 20:44:32,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:32,654 INFO L93 Difference]: Finished difference Result 1484 states and 5151 transitions. [2020-02-10 20:44:32,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:32,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:32,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:32,659 INFO L225 Difference]: With dead ends: 1484 [2020-02-10 20:44:32,659 INFO L226 Difference]: Without dead ends: 1464 [2020-02-10 20:44:32,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-02-10 20:44:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2020-02-10 20:44:32,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 798. [2020-02-10 20:44:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:44:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3170 transitions. [2020-02-10 20:44:32,683 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3170 transitions. Word has length 25 [2020-02-10 20:44:32,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:32,683 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3170 transitions. [2020-02-10 20:44:32,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:32,683 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3170 transitions. [2020-02-10 20:44:32,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:32,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:32,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-02-10 20:44:32,685 INFO L427 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-02-10 20:44:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:32,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2026726967, now seen corresponding path program 399 times [2020-02-10 20:44:32,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:32,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993333563] [2020-02-10 20:44:32,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:33,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993333563] [2020-02-10 20:44:33,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:33,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:33,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567904448] [2020-02-10 20:44:33,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:33,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:33,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:33,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:33,089 INFO L87 Difference]: Start difference. First operand 798 states and 3170 transitions. Second operand 10 states. [2020-02-10 20:44:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:33,238 INFO L93 Difference]: Finished difference Result 1484 states and 5150 transitions. [2020-02-10 20:44:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:33,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:33,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:33,243 INFO L225 Difference]: With dead ends: 1484 [2020-02-10 20:44:33,243 INFO L226 Difference]: Without dead ends: 1471 [2020-02-10 20:44:33,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-02-10 20:44:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-02-10 20:44:33,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 803. [2020-02-10 20:44:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:44:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3179 transitions. [2020-02-10 20:44:33,268 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3179 transitions. Word has length 25 [2020-02-10 20:44:33,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:33,268 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3179 transitions. [2020-02-10 20:44:33,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3179 transitions. [2020-02-10 20:44:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:33,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:33,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-02-10 20:44:33,269 INFO L427 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-02-10 20:44:33,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:33,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1255976299, now seen corresponding path program 400 times [2020-02-10 20:44:33,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:33,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553838232] [2020-02-10 20:44:33,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:33,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553838232] [2020-02-10 20:44:33,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:33,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:33,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898771950] [2020-02-10 20:44:33,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:33,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:33,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:33,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:33,690 INFO L87 Difference]: Start difference. First operand 803 states and 3179 transitions. Second operand 10 states. [2020-02-10 20:44:33,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:33,810 INFO L93 Difference]: Finished difference Result 1489 states and 5155 transitions. [2020-02-10 20:44:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:33,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:33,814 INFO L225 Difference]: With dead ends: 1489 [2020-02-10 20:44:33,815 INFO L226 Difference]: Without dead ends: 1466 [2020-02-10 20:44:33,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:33,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2020-02-10 20:44:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 798. [2020-02-10 20:44:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:44:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3165 transitions. [2020-02-10 20:44:33,839 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3165 transitions. Word has length 25 [2020-02-10 20:44:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:33,839 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3165 transitions. [2020-02-10 20:44:33,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3165 transitions. [2020-02-10 20:44:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:33,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:33,840 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:33,840 INFO L427 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-02-10 20:44:33,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:33,841 INFO L82 PathProgramCache]: Analyzing trace with hash 481330491, now seen corresponding path program 401 times [2020-02-10 20:44:33,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:33,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258670333] [2020-02-10 20:44:33,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:34,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258670333] [2020-02-10 20:44:34,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:34,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:34,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396149163] [2020-02-10 20:44:34,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:34,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:34,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:34,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:34,262 INFO L87 Difference]: Start difference. First operand 798 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:44:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:34,456 INFO L93 Difference]: Finished difference Result 1494 states and 5167 transitions. [2020-02-10 20:44:34,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:34,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:34,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:34,460 INFO L225 Difference]: With dead ends: 1494 [2020-02-10 20:44:34,461 INFO L226 Difference]: Without dead ends: 1478 [2020-02-10 20:44:34,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-02-10 20:44:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 807. [2020-02-10 20:44:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:44:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3181 transitions. [2020-02-10 20:44:34,485 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3181 transitions. Word has length 25 [2020-02-10 20:44:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:34,485 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3181 transitions. [2020-02-10 20:44:34,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3181 transitions. [2020-02-10 20:44:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:34,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:34,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-02-10 20:44:34,487 INFO L427 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-02-10 20:44:34,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:34,487 INFO L82 PathProgramCache]: Analyzing trace with hash -591754889, now seen corresponding path program 402 times [2020-02-10 20:44:34,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:34,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919337793] [2020-02-10 20:44:34,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:34,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919337793] [2020-02-10 20:44:34,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:34,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:34,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60829872] [2020-02-10 20:44:34,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:34,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:34,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:34,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:34,913 INFO L87 Difference]: Start difference. First operand 807 states and 3181 transitions. Second operand 10 states. [2020-02-10 20:44:35,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:35,086 INFO L93 Difference]: Finished difference Result 1496 states and 5163 transitions. [2020-02-10 20:44:35,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:35,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:35,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:35,090 INFO L225 Difference]: With dead ends: 1496 [2020-02-10 20:44:35,090 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 20:44:35,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:35,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 20:44:35,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 792. [2020-02-10 20:44:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:44:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3148 transitions. [2020-02-10 20:44:35,115 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3148 transitions. Word has length 25 [2020-02-10 20:44:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:35,115 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3148 transitions. [2020-02-10 20:44:35,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3148 transitions. [2020-02-10 20:44:35,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:35,116 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:35,116 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:35,116 INFO L427 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-02-10 20:44:35,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:35,117 INFO L82 PathProgramCache]: Analyzing trace with hash -229869483, now seen corresponding path program 403 times [2020-02-10 20:44:35,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:35,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944863079] [2020-02-10 20:44:35,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:35,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944863079] [2020-02-10 20:44:35,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:35,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:35,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628598633] [2020-02-10 20:44:35,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:35,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:35,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:35,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:35,567 INFO L87 Difference]: Start difference. First operand 792 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:44:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:35,715 INFO L93 Difference]: Finished difference Result 1496 states and 5182 transitions. [2020-02-10 20:44:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:35,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:35,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:35,719 INFO L225 Difference]: With dead ends: 1496 [2020-02-10 20:44:35,719 INFO L226 Difference]: Without dead ends: 1481 [2020-02-10 20:44:35,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-02-10 20:44:35,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2020-02-10 20:44:35,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 807. [2020-02-10 20:44:35,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:44:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3188 transitions. [2020-02-10 20:44:35,744 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3188 transitions. Word has length 25 [2020-02-10 20:44:35,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:35,744 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3188 transitions. [2020-02-10 20:44:35,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3188 transitions. [2020-02-10 20:44:35,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:35,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:35,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-02-10 20:44:35,746 INFO L427 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-02-10 20:44:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:35,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954863, now seen corresponding path program 404 times [2020-02-10 20:44:35,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:35,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816135301] [2020-02-10 20:44:35,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:36,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816135301] [2020-02-10 20:44:36,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:36,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:36,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654560986] [2020-02-10 20:44:36,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:36,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:36,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:36,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:36,169 INFO L87 Difference]: Start difference. First operand 807 states and 3188 transitions. Second operand 10 states. [2020-02-10 20:44:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:36,313 INFO L93 Difference]: Finished difference Result 1497 states and 5178 transitions. [2020-02-10 20:44:36,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:36,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:36,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:36,317 INFO L225 Difference]: With dead ends: 1497 [2020-02-10 20:44:36,317 INFO L226 Difference]: Without dead ends: 1475 [2020-02-10 20:44:36,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2020-02-10 20:44:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 801. [2020-02-10 20:44:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:44:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3171 transitions. [2020-02-10 20:44:36,353 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3171 transitions. Word has length 25 [2020-02-10 20:44:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:36,353 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3171 transitions. [2020-02-10 20:44:36,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:36,353 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3171 transitions. [2020-02-10 20:44:36,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:36,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:36,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-02-10 20:44:36,355 INFO L427 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-02-10 20:44:36,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:36,355 INFO L82 PathProgramCache]: Analyzing trace with hash 864222105, now seen corresponding path program 405 times [2020-02-10 20:44:36,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:36,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660303967] [2020-02-10 20:44:36,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:36,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660303967] [2020-02-10 20:44:36,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:36,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:36,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615422519] [2020-02-10 20:44:36,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:36,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:36,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:36,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:36,764 INFO L87 Difference]: Start difference. First operand 801 states and 3171 transitions. Second operand 10 states. [2020-02-10 20:44:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:36,916 INFO L93 Difference]: Finished difference Result 1499 states and 5181 transitions. [2020-02-10 20:44:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:36,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:36,920 INFO L225 Difference]: With dead ends: 1499 [2020-02-10 20:44:36,921 INFO L226 Difference]: Without dead ends: 1484 [2020-02-10 20:44:36,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:36,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-02-10 20:44:36,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 808. [2020-02-10 20:44:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-02-10 20:44:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3184 transitions. [2020-02-10 20:44:36,946 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3184 transitions. Word has length 25 [2020-02-10 20:44:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:36,946 INFO L479 AbstractCegarLoop]: Abstraction has 808 states and 3184 transitions. [2020-02-10 20:44:36,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3184 transitions. [2020-02-10 20:44:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:36,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:36,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:36,947 INFO L427 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-02-10 20:44:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:36,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1281948655, now seen corresponding path program 406 times [2020-02-10 20:44:36,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:36,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862280857] [2020-02-10 20:44:36,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:37,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862280857] [2020-02-10 20:44:37,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:37,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:37,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118058515] [2020-02-10 20:44:37,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:37,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:37,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:37,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:37,369 INFO L87 Difference]: Start difference. First operand 808 states and 3184 transitions. Second operand 10 states. [2020-02-10 20:44:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:37,491 INFO L93 Difference]: Finished difference Result 1502 states and 5180 transitions. [2020-02-10 20:44:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:37,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:37,495 INFO L225 Difference]: With dead ends: 1502 [2020-02-10 20:44:37,495 INFO L226 Difference]: Without dead ends: 1477 [2020-02-10 20:44:37,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2020-02-10 20:44:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 801. [2020-02-10 20:44:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:44:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3164 transitions. [2020-02-10 20:44:37,520 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3164 transitions. Word has length 25 [2020-02-10 20:44:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:37,520 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3164 transitions. [2020-02-10 20:44:37,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3164 transitions. [2020-02-10 20:44:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:37,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:37,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-02-10 20:44:37,521 INFO L427 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-02-10 20:44:37,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:37,522 INFO L82 PathProgramCache]: Analyzing trace with hash 885228313, now seen corresponding path program 407 times [2020-02-10 20:44:37,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:37,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315123818] [2020-02-10 20:44:37,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:37,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315123818] [2020-02-10 20:44:37,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:37,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:37,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59149426] [2020-02-10 20:44:37,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:37,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:37,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:37,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:37,946 INFO L87 Difference]: Start difference. First operand 801 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:44:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:38,141 INFO L93 Difference]: Finished difference Result 1503 states and 5182 transitions. [2020-02-10 20:44:38,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:38,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:38,145 INFO L225 Difference]: With dead ends: 1503 [2020-02-10 20:44:38,146 INFO L226 Difference]: Without dead ends: 1487 [2020-02-10 20:44:38,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-02-10 20:44:38,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2020-02-10 20:44:38,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 810. [2020-02-10 20:44:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-02-10 20:44:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3180 transitions. [2020-02-10 20:44:38,170 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3180 transitions. Word has length 25 [2020-02-10 20:44:38,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:38,170 INFO L479 AbstractCegarLoop]: Abstraction has 810 states and 3180 transitions. [2020-02-10 20:44:38,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:38,170 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3180 transitions. [2020-02-10 20:44:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:38,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:38,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-02-10 20:44:38,172 INFO L427 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-02-10 20:44:38,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:38,172 INFO L82 PathProgramCache]: Analyzing trace with hash -187857067, now seen corresponding path program 408 times [2020-02-10 20:44:38,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:38,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782456162] [2020-02-10 20:44:38,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:38,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782456162] [2020-02-10 20:44:38,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:38,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:38,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063662244] [2020-02-10 20:44:38,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:38,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:38,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:38,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:38,603 INFO L87 Difference]: Start difference. First operand 810 states and 3180 transitions. Second operand 10 states. [2020-02-10 20:44:38,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:38,765 INFO L93 Difference]: Finished difference Result 1505 states and 5178 transitions. [2020-02-10 20:44:38,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:38,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:38,769 INFO L225 Difference]: With dead ends: 1505 [2020-02-10 20:44:38,769 INFO L226 Difference]: Without dead ends: 1462 [2020-02-10 20:44:38,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-02-10 20:44:38,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-02-10 20:44:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 785. [2020-02-10 20:44:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:44:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3128 transitions. [2020-02-10 20:44:38,793 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3128 transitions. Word has length 25 [2020-02-10 20:44:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:38,793 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3128 transitions. [2020-02-10 20:44:38,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3128 transitions. [2020-02-10 20:44:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:38,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:38,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-02-10 20:44:38,795 INFO L427 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-02-10 20:44:38,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:38,795 INFO L82 PathProgramCache]: Analyzing trace with hash -327140489, now seen corresponding path program 409 times [2020-02-10 20:44:38,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:38,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137518955] [2020-02-10 20:44:38,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:39,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137518955] [2020-02-10 20:44:39,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:39,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:39,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099083251] [2020-02-10 20:44:39,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:39,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:39,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:39,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:39,198 INFO L87 Difference]: Start difference. First operand 785 states and 3128 transitions. Second operand 10 states. [2020-02-10 20:44:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:39,364 INFO L93 Difference]: Finished difference Result 1456 states and 5096 transitions. [2020-02-10 20:44:39,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:39,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:39,368 INFO L225 Difference]: With dead ends: 1456 [2020-02-10 20:44:39,368 INFO L226 Difference]: Without dead ends: 1443 [2020-02-10 20:44:39,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-02-10 20:44:39,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 798. [2020-02-10 20:44:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:44:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3173 transitions. [2020-02-10 20:44:39,393 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3173 transitions. Word has length 25 [2020-02-10 20:44:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:39,393 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3173 transitions. [2020-02-10 20:44:39,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3173 transitions. [2020-02-10 20:44:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:39,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:39,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:39,394 INFO L427 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-02-10 20:44:39,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:39,394 INFO L82 PathProgramCache]: Analyzing trace with hash 643111125, now seen corresponding path program 410 times [2020-02-10 20:44:39,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:39,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942881843] [2020-02-10 20:44:39,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:39,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942881843] [2020-02-10 20:44:39,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:39,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:39,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506228111] [2020-02-10 20:44:39,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:39,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:39,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:39,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:39,800 INFO L87 Difference]: Start difference. First operand 798 states and 3173 transitions. Second operand 10 states. [2020-02-10 20:44:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:39,947 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-02-10 20:44:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:39,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:39,951 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 20:44:39,951 INFO L226 Difference]: Without dead ends: 1439 [2020-02-10 20:44:39,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-02-10 20:44:39,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 794. [2020-02-10 20:44:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:44:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-02-10 20:44:39,976 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-02-10 20:44:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:39,976 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-02-10 20:44:39,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-02-10 20:44:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:39,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:39,977 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:39,977 INFO L427 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-02-10 20:44:39,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:39,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1155994449, now seen corresponding path program 411 times [2020-02-10 20:44:39,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:39,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674967174] [2020-02-10 20:44:39,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:40,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-02-10 20:44:40,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674967174] [2020-02-10 20:44:40,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:40,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:40,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640909565] [2020-02-10 20:44:40,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:40,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:40,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:40,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:40,389 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:44:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:40,546 INFO L93 Difference]: Finished difference Result 1455 states and 5090 transitions. [2020-02-10 20:44:40,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:40,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:40,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:40,550 INFO L225 Difference]: With dead ends: 1455 [2020-02-10 20:44:40,551 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 20:44:40,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 20:44:40,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 798. [2020-02-10 20:44:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:44:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3169 transitions. [2020-02-10 20:44:40,575 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3169 transitions. Word has length 25 [2020-02-10 20:44:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:40,575 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3169 transitions. [2020-02-10 20:44:40,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3169 transitions. [2020-02-10 20:44:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:40,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:40,576 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:40,576 INFO L427 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-02-10 20:44:40,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2137211921, now seen corresponding path program 412 times [2020-02-10 20:44:40,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:40,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957225056] [2020-02-10 20:44:40,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:40,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:40,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957225056] [2020-02-10 20:44:40,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:40,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:40,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333250418] [2020-02-10 20:44:40,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:40,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:40,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:40,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:40,989 INFO L87 Difference]: Start difference. First operand 798 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:44:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:41,145 INFO L93 Difference]: Finished difference Result 1456 states and 5088 transitions. [2020-02-10 20:44:41,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:41,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:41,149 INFO L225 Difference]: With dead ends: 1456 [2020-02-10 20:44:41,149 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 20:44:41,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 20:44:41,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 794. [2020-02-10 20:44:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:44:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3158 transitions. [2020-02-10 20:44:41,173 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3158 transitions. Word has length 25 [2020-02-10 20:44:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:41,174 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3158 transitions. [2020-02-10 20:44:41,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3158 transitions. [2020-02-10 20:44:41,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:41,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:41,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:41,175 INFO L427 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-02-10 20:44:41,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:41,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1632928759, now seen corresponding path program 413 times [2020-02-10 20:44:41,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:41,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465803817] [2020-02-10 20:44:41,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:41,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465803817] [2020-02-10 20:44:41,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:41,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:41,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427790993] [2020-02-10 20:44:41,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:41,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:41,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:41,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:41,583 INFO L87 Difference]: Start difference. First operand 794 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:44:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:41,732 INFO L93 Difference]: Finished difference Result 1460 states and 5097 transitions. [2020-02-10 20:44:41,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:41,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:41,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:41,737 INFO L225 Difference]: With dead ends: 1460 [2020-02-10 20:44:41,737 INFO L226 Difference]: Without dead ends: 1445 [2020-02-10 20:44:41,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-02-10 20:44:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2020-02-10 20:44:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 799. [2020-02-10 20:44:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:44:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-02-10 20:44:41,761 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-02-10 20:44:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:41,761 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-02-10 20:44:41,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-02-10 20:44:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:41,763 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:41,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-02-10 20:44:41,763 INFO L427 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-02-10 20:44:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:41,763 INFO L82 PathProgramCache]: Analyzing trace with hash -2124182959, now seen corresponding path program 414 times [2020-02-10 20:44:41,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:41,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325284578] [2020-02-10 20:44:41,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:42,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325284578] [2020-02-10 20:44:42,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:42,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:42,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907460231] [2020-02-10 20:44:42,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:42,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:42,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:42,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:42,165 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:44:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:42,305 INFO L93 Difference]: Finished difference Result 1459 states and 5090 transitions. [2020-02-10 20:44:42,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:42,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:42,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:42,309 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 20:44:42,309 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:44:42,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-02-10 20:44:42,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:44:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 790. [2020-02-10 20:44:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:44:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3147 transitions. [2020-02-10 20:44:42,333 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3147 transitions. Word has length 25 [2020-02-10 20:44:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:42,334 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3147 transitions. [2020-02-10 20:44:42,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3147 transitions. [2020-02-10 20:44:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:42,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:42,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-02-10 20:44:42,335 INFO L427 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-02-10 20:44:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash -749626215, now seen corresponding path program 415 times [2020-02-10 20:44:42,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:42,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226132993] [2020-02-10 20:44:42,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:42,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226132993] [2020-02-10 20:44:42,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:42,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:42,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581213284] [2020-02-10 20:44:42,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:42,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:42,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:42,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:42,735 INFO L87 Difference]: Start difference. First operand 790 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:44:42,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:42,873 INFO L93 Difference]: Finished difference Result 1464 states and 5109 transitions. [2020-02-10 20:44:42,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:42,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:42,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:42,878 INFO L225 Difference]: With dead ends: 1464 [2020-02-10 20:44:42,878 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 20:44:42,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:42,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 20:44:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 799. [2020-02-10 20:44:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:44:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3172 transitions. [2020-02-10 20:44:42,902 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3172 transitions. Word has length 25 [2020-02-10 20:44:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:42,903 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3172 transitions. [2020-02-10 20:44:42,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3172 transitions. [2020-02-10 20:44:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:42,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:42,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-02-10 20:44:42,904 INFO L427 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-02-10 20:44:42,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:42,904 INFO L82 PathProgramCache]: Analyzing trace with hash 220625399, now seen corresponding path program 416 times [2020-02-10 20:44:42,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:42,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273897586] [2020-02-10 20:44:42,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:43,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273897586] [2020-02-10 20:44:43,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:43,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:43,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036186613] [2020-02-10 20:44:43,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:43,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:43,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:43,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:43,307 INFO L87 Difference]: Start difference. First operand 799 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:44:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:43,456 INFO L93 Difference]: Finished difference Result 1466 states and 5109 transitions. [2020-02-10 20:44:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:43,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:43,460 INFO L225 Difference]: With dead ends: 1466 [2020-02-10 20:44:43,461 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 20:44:43,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 20:44:43,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 795. [2020-02-10 20:44:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:44:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3161 transitions. [2020-02-10 20:44:43,485 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3161 transitions. Word has length 25 [2020-02-10 20:44:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:43,485 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3161 transitions. [2020-02-10 20:44:43,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3161 transitions. [2020-02-10 20:44:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:43,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:43,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-02-10 20:44:43,487 INFO L427 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-02-10 20:44:43,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:43,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1635424495, now seen corresponding path program 417 times [2020-02-10 20:44:43,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:43,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388586918] [2020-02-10 20:44:43,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:43,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388586918] [2020-02-10 20:44:43,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:43,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:43,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127936636] [2020-02-10 20:44:43,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:43,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:43,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:43,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:43,903 INFO L87 Difference]: Start difference. First operand 795 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:44:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:44,044 INFO L93 Difference]: Finished difference Result 1468 states and 5112 transitions. [2020-02-10 20:44:44,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:44,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:44,049 INFO L225 Difference]: With dead ends: 1468 [2020-02-10 20:44:44,049 INFO L226 Difference]: Without dead ends: 1455 [2020-02-10 20:44:44,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-02-10 20:44:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 800. [2020-02-10 20:44:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:44:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3170 transitions. [2020-02-10 20:44:44,076 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3170 transitions. Word has length 25 [2020-02-10 20:44:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:44,076 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3170 transitions. [2020-02-10 20:44:44,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:44,076 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3170 transitions. [2020-02-10 20:44:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:44,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:44,077 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:44,077 INFO L427 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-02-10 20:44:44,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:44,077 INFO L82 PathProgramCache]: Analyzing trace with hash -623160465, now seen corresponding path program 418 times [2020-02-10 20:44:44,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:44,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843207962] [2020-02-10 20:44:44,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:44,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843207962] [2020-02-10 20:44:44,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:44,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:44,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130434874] [2020-02-10 20:44:44,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:44,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:44,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:44,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:44,507 INFO L87 Difference]: Start difference. First operand 800 states and 3170 transitions. Second operand 10 states. [2020-02-10 20:44:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:44,656 INFO L93 Difference]: Finished difference Result 1473 states and 5117 transitions. [2020-02-10 20:44:44,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:44,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:44,659 INFO L225 Difference]: With dead ends: 1473 [2020-02-10 20:44:44,659 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 20:44:44,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 20:44:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 795. [2020-02-10 20:44:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:44:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-02-10 20:44:44,684 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-02-10 20:44:44,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:44,684 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-02-10 20:44:44,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-02-10 20:44:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:44,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:44,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-02-10 20:44:44,685 INFO L427 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-02-10 20:44:44,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:44,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1536039257, now seen corresponding path program 419 times [2020-02-10 20:44:44,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:44,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156052614] [2020-02-10 20:44:44,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:45,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:45,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156052614] [2020-02-10 20:44:45,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:45,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:45,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851777986] [2020-02-10 20:44:45,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:45,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:45,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:45,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:45,098 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:44:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:45,237 INFO L93 Difference]: Finished difference Result 1474 states and 5121 transitions. [2020-02-10 20:44:45,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:45,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:45,241 INFO L225 Difference]: With dead ends: 1474 [2020-02-10 20:44:45,241 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 20:44:45,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 20:44:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 802. [2020-02-10 20:44:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:44:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3169 transitions. [2020-02-10 20:44:45,265 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3169 transitions. Word has length 25 [2020-02-10 20:44:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:45,266 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3169 transitions. [2020-02-10 20:44:45,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3169 transitions. [2020-02-10 20:44:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:45,267 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:45,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-02-10 20:44:45,267 INFO L427 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-02-10 20:44:45,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:45,267 INFO L82 PathProgramCache]: Analyzing trace with hash -610131503, now seen corresponding path program 420 times [2020-02-10 20:44:45,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:45,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235871639] [2020-02-10 20:44:45,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:45,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235871639] [2020-02-10 20:44:45,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:45,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:45,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028671900] [2020-02-10 20:44:45,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:45,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:45,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:45,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:45,681 INFO L87 Difference]: Start difference. First operand 802 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:44:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:45,803 INFO L93 Difference]: Finished difference Result 1477 states and 5120 transitions. [2020-02-10 20:44:45,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:45,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:45,806 INFO L225 Difference]: With dead ends: 1477 [2020-02-10 20:44:45,807 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 20:44:45,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 20:44:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 790. [2020-02-10 20:44:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:44:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3142 transitions. [2020-02-10 20:44:45,831 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3142 transitions. Word has length 25 [2020-02-10 20:44:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:45,831 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3142 transitions. [2020-02-10 20:44:45,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3142 transitions. [2020-02-10 20:44:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:45,832 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:45,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-02-10 20:44:45,832 INFO L427 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-02-10 20:44:45,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:45,832 INFO L82 PathProgramCache]: Analyzing trace with hash -533948455, now seen corresponding path program 421 times [2020-02-10 20:44:45,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:45,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612681684] [2020-02-10 20:44:45,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:46,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612681684] [2020-02-10 20:44:46,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:46,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:46,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666709351] [2020-02-10 20:44:46,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:46,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:46,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:46,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:46,242 INFO L87 Difference]: Start difference. First operand 790 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:44:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:46,389 INFO L93 Difference]: Finished difference Result 1461 states and 5097 transitions. [2020-02-10 20:44:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:46,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:46,393 INFO L225 Difference]: With dead ends: 1461 [2020-02-10 20:44:46,393 INFO L226 Difference]: Without dead ends: 1448 [2020-02-10 20:44:46,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-02-10 20:44:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 799. [2020-02-10 20:44:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:44:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-02-10 20:44:46,418 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-02-10 20:44:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:46,418 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-02-10 20:44:46,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-02-10 20:44:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:46,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:46,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-02-10 20:44:46,419 INFO L427 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-02-10 20:44:46,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:46,419 INFO L82 PathProgramCache]: Analyzing trace with hash 467812471, now seen corresponding path program 422 times [2020-02-10 20:44:46,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:46,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069262608] [2020-02-10 20:44:46,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:46,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-02-10 20:44:46,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069262608] [2020-02-10 20:44:46,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:46,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:46,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287568282] [2020-02-10 20:44:46,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:46,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:46,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:46,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:46,824 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:44:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:46,976 INFO L93 Difference]: Finished difference Result 1462 states and 5095 transitions. [2020-02-10 20:44:46,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:46,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:46,981 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 20:44:46,981 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:44:46,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:46,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:44:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 795. [2020-02-10 20:44:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:44:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-02-10 20:44:47,005 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-02-10 20:44:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:47,005 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-02-10 20:44:47,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-02-10 20:44:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:47,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:47,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-02-10 20:44:47,006 INFO L427 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-02-10 20:44:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1392085623, now seen corresponding path program 423 times [2020-02-10 20:44:47,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:47,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445033457] [2020-02-10 20:44:47,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:47,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445033457] [2020-02-10 20:44:47,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:47,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:47,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025323627] [2020-02-10 20:44:47,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:47,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:47,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:47,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:47,416 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:44:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:47,554 INFO L93 Difference]: Finished difference Result 1466 states and 5102 transitions. [2020-02-10 20:44:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:47,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:47,558 INFO L225 Difference]: With dead ends: 1466 [2020-02-10 20:44:47,559 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 20:44:47,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-02-10 20:44:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 20:44:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 800. [2020-02-10 20:44:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:44:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3165 transitions. [2020-02-10 20:44:47,583 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3165 transitions. Word has length 25 [2020-02-10 20:44:47,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:47,583 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3165 transitions. [2020-02-10 20:44:47,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3165 transitions. [2020-02-10 20:44:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:47,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:47,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:47,585 INFO L427 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-02-10 20:44:47,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1890617643, now seen corresponding path program 424 times [2020-02-10 20:44:47,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:47,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467494128] [2020-02-10 20:44:47,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:47,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467494128] [2020-02-10 20:44:47,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:47,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:47,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21039429] [2020-02-10 20:44:47,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:47,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:47,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:47,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:47,998 INFO L87 Difference]: Start difference. First operand 800 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:44:48,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:48,116 INFO L93 Difference]: Finished difference Result 1471 states and 5107 transitions. [2020-02-10 20:44:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:48,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:48,120 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 20:44:48,120 INFO L226 Difference]: Without dead ends: 1448 [2020-02-10 20:44:48,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:48,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-02-10 20:44:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 795. [2020-02-10 20:44:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:44:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-02-10 20:44:48,144 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-02-10 20:44:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:48,144 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-02-10 20:44:48,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-02-10 20:44:48,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:48,145 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:48,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-02-10 20:44:48,145 INFO L427 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-02-10 20:44:48,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:48,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1783226329, now seen corresponding path program 425 times [2020-02-10 20:44:48,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:48,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26060006] [2020-02-10 20:44:48,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:48,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-02-10 20:44:48,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26060006] [2020-02-10 20:44:48,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:48,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:48,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651245709] [2020-02-10 20:44:48,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:48,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:48,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:48,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:48,551 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:44:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:48,722 INFO L93 Difference]: Finished difference Result 1469 states and 5104 transitions. [2020-02-10 20:44:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:48,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:48,727 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 20:44:48,727 INFO L226 Difference]: Without dead ends: 1455 [2020-02-10 20:44:48,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-02-10 20:44:48,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-02-10 20:44:48,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 801. [2020-02-10 20:44:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:44:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3162 transitions. [2020-02-10 20:44:48,752 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3162 transitions. Word has length 25 [2020-02-10 20:44:48,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:48,752 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3162 transitions. [2020-02-10 20:44:48,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3162 transitions. [2020-02-10 20:44:48,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:48,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:48,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-02-10 20:44:48,753 INFO L427 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-02-10 20:44:48,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:48,753 INFO L82 PathProgramCache]: Analyzing trace with hash -900800009, now seen corresponding path program 426 times [2020-02-10 20:44:48,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:48,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766506171] [2020-02-10 20:44:48,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:49,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766506171] [2020-02-10 20:44:49,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:49,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:49,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660517923] [2020-02-10 20:44:49,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:49,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:49,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:49,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:49,165 INFO L87 Difference]: Start difference. First operand 801 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:44:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:49,270 INFO L93 Difference]: Finished difference Result 1473 states and 5106 transitions. [2020-02-10 20:44:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:49,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:49,274 INFO L225 Difference]: With dead ends: 1473 [2020-02-10 20:44:49,275 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:44:49,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-02-10 20:44:49,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:44:49,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 790. [2020-02-10 20:44:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:44:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3137 transitions. [2020-02-10 20:44:49,299 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3137 transitions. Word has length 25 [2020-02-10 20:44:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:49,299 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3137 transitions. [2020-02-10 20:44:49,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3137 transitions. [2020-02-10 20:44:49,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:49,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:49,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-02-10 20:44:49,300 INFO L427 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-02-10 20:44:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash -538914603, now seen corresponding path program 427 times [2020-02-10 20:44:49,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:49,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723189768] [2020-02-10 20:44:49,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:49,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723189768] [2020-02-10 20:44:49,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:49,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:49,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470472272] [2020-02-10 20:44:49,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:49,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:49,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:49,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:49,710 INFO L87 Difference]: Start difference. First operand 790 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:44:49,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:49,868 INFO L93 Difference]: Finished difference Result 1472 states and 5120 transitions. [2020-02-10 20:44:49,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:49,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:49,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:49,872 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 20:44:49,872 INFO L226 Difference]: Without dead ends: 1457 [2020-02-10 20:44:49,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-02-10 20:44:49,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-02-10 20:44:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 801. [2020-02-10 20:44:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:44:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3168 transitions. [2020-02-10 20:44:49,897 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3168 transitions. Word has length 25 [2020-02-10 20:44:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:49,897 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3168 transitions. [2020-02-10 20:44:49,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3168 transitions. [2020-02-10 20:44:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:49,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:49,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-02-10 20:44:49,899 INFO L427 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-02-10 20:44:49,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:49,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1059025, now seen corresponding path program 428 times [2020-02-10 20:44:49,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:49,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056872576] [2020-02-10 20:44:49,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:50,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056872576] [2020-02-10 20:44:50,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:50,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:50,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302031792] [2020-02-10 20:44:50,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:50,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:50,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:50,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:50,311 INFO L87 Difference]: Start difference. First operand 801 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:44:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:50,454 INFO L93 Difference]: Finished difference Result 1471 states and 5113 transitions. [2020-02-10 20:44:50,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:50,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:50,458 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 20:44:50,458 INFO L226 Difference]: Without dead ends: 1452 [2020-02-10 20:44:50,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-02-10 20:44:50,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 796. [2020-02-10 20:44:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:44:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3154 transitions. [2020-02-10 20:44:50,482 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3154 transitions. Word has length 25 [2020-02-10 20:44:50,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:50,482 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3154 transitions. [2020-02-10 20:44:50,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3154 transitions. [2020-02-10 20:44:50,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:50,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:50,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:50,484 INFO L427 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-02-10 20:44:50,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:50,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2139352457, now seen corresponding path program 429 times [2020-02-10 20:44:50,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:50,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147244916] [2020-02-10 20:44:50,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:50,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147244916] [2020-02-10 20:44:50,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:50,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:50,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398591139] [2020-02-10 20:44:50,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:50,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:50,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:50,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:50,894 INFO L87 Difference]: Start difference. First operand 796 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:44:51,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:51,046 INFO L93 Difference]: Finished difference Result 1478 states and 5127 transitions. [2020-02-10 20:44:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:51,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:51,051 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 20:44:51,051 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 20:44:51,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 20:44:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 803. [2020-02-10 20:44:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:44:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3167 transitions. [2020-02-10 20:44:51,075 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3167 transitions. Word has length 25 [2020-02-10 20:44:51,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:51,075 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3167 transitions. [2020-02-10 20:44:51,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3167 transitions. [2020-02-10 20:44:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:51,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:51,077 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:51,077 INFO L427 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-02-10 20:44:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:51,077 INFO L82 PathProgramCache]: Analyzing trace with hash 9444079, now seen corresponding path program 430 times [2020-02-10 20:44:51,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:51,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114872795] [2020-02-10 20:44:51,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:51,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114872795] [2020-02-10 20:44:51,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:51,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:51,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473437210] [2020-02-10 20:44:51,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:51,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:51,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:51,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:51,487 INFO L87 Difference]: Start difference. First operand 803 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:44:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:51,605 INFO L93 Difference]: Finished difference Result 1481 states and 5126 transitions. [2020-02-10 20:44:51,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:51,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:51,610 INFO L225 Difference]: With dead ends: 1481 [2020-02-10 20:44:51,610 INFO L226 Difference]: Without dead ends: 1456 [2020-02-10 20:44:51,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:51,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-02-10 20:44:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 796. [2020-02-10 20:44:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:44:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-02-10 20:44:51,634 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-02-10 20:44:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:51,634 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-02-10 20:44:51,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-02-10 20:44:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:51,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:51,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-02-10 20:44:51,635 INFO L427 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-02-10 20:44:51,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:51,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2107843145, now seen corresponding path program 431 times [2020-02-10 20:44:51,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:51,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401352412] [2020-02-10 20:44:51,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:52,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:52,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401352412] [2020-02-10 20:44:52,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:52,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:52,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882332901] [2020-02-10 20:44:52,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:52,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:52,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:52,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:52,046 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:44:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:52,180 INFO L93 Difference]: Finished difference Result 1475 states and 5114 transitions. [2020-02-10 20:44:52,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:52,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:52,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:52,184 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 20:44:52,185 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 20:44:52,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 20:44:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 802. [2020-02-10 20:44:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:44:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3159 transitions. [2020-02-10 20:44:52,209 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3159 transitions. Word has length 25 [2020-02-10 20:44:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:52,209 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3159 transitions. [2020-02-10 20:44:52,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3159 transitions. [2020-02-10 20:44:52,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:52,210 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:52,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-02-10 20:44:52,210 INFO L427 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-02-10 20:44:52,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:52,211 INFO L82 PathProgramCache]: Analyzing trace with hash -496902187, now seen corresponding path program 432 times [2020-02-10 20:44:52,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:52,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773029993] [2020-02-10 20:44:52,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:52,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773029993] [2020-02-10 20:44:52,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:52,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:52,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266008614] [2020-02-10 20:44:52,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:52,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:52,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:52,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:52,627 INFO L87 Difference]: Start difference. First operand 802 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:44:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:52,748 INFO L93 Difference]: Finished difference Result 1479 states and 5116 transitions. [2020-02-10 20:44:52,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:52,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:52,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:52,751 INFO L225 Difference]: With dead ends: 1479 [2020-02-10 20:44:52,752 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:44:52,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:44:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 785. [2020-02-10 20:44:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:44:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3123 transitions. [2020-02-10 20:44:52,786 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3123 transitions. Word has length 25 [2020-02-10 20:44:52,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:52,786 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3123 transitions. [2020-02-10 20:44:52,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:52,786 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3123 transitions. [2020-02-10 20:44:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:52,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:52,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-02-10 20:44:52,787 INFO L427 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-02-10 20:44:52,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:52,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2039322317, now seen corresponding path program 433 times [2020-02-10 20:44:52,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:52,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896461830] [2020-02-10 20:44:52,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:53,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896461830] [2020-02-10 20:44:53,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:53,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:53,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984478910] [2020-02-10 20:44:53,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:53,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:53,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:53,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:53,188 INFO L87 Difference]: Start difference. First operand 785 states and 3123 transitions. Second operand 10 states. [2020-02-10 20:44:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:53,351 INFO L93 Difference]: Finished difference Result 1464 states and 5108 transitions. [2020-02-10 20:44:53,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:53,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:53,355 INFO L225 Difference]: With dead ends: 1464 [2020-02-10 20:44:53,355 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 20:44:53,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:53,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 20:44:53,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 799. [2020-02-10 20:44:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:44:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3171 transitions. [2020-02-10 20:44:53,380 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3171 transitions. Word has length 25 [2020-02-10 20:44:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:53,380 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3171 transitions. [2020-02-10 20:44:53,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3171 transitions. [2020-02-10 20:44:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:53,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:53,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-02-10 20:44:53,382 INFO L427 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-02-10 20:44:53,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:53,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1048064495, now seen corresponding path program 434 times [2020-02-10 20:44:53,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:53,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824257991] [2020-02-10 20:44:53,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:53,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824257991] [2020-02-10 20:44:53,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:53,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:53,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590428396] [2020-02-10 20:44:53,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:53,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:53,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:53,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:53,784 INFO L87 Difference]: Start difference. First operand 799 states and 3171 transitions. Second operand 10 states. [2020-02-10 20:44:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:53,953 INFO L93 Difference]: Finished difference Result 1467 states and 5110 transitions. [2020-02-10 20:44:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:53,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:53,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:53,958 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 20:44:53,958 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 20:44:53,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-02-10 20:44:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 20:44:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 795. [2020-02-10 20:44:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:44:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3160 transitions. [2020-02-10 20:44:53,982 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3160 transitions. Word has length 25 [2020-02-10 20:44:53,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:53,982 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3160 transitions. [2020-02-10 20:44:53,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:53,982 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3160 transitions. [2020-02-10 20:44:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:53,983 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:53,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-02-10 20:44:53,984 INFO L427 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-02-10 20:44:53,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:53,984 INFO L82 PathProgramCache]: Analyzing trace with hash -113288239, now seen corresponding path program 435 times [2020-02-10 20:44:53,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:53,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951362311] [2020-02-10 20:44:53,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:54,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951362311] [2020-02-10 20:44:54,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:54,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:54,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941352401] [2020-02-10 20:44:54,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:54,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:54,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:54,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:54,390 INFO L87 Difference]: Start difference. First operand 795 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:44:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:54,570 INFO L93 Difference]: Finished difference Result 1462 states and 5100 transitions. [2020-02-10 20:44:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:54,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:54,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:54,574 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 20:44:54,574 INFO L226 Difference]: Without dead ends: 1449 [2020-02-10 20:44:54,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-02-10 20:44:54,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 799. [2020-02-10 20:44:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:44:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-02-10 20:44:54,599 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-02-10 20:44:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:54,599 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-02-10 20:44:54,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-02-10 20:44:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:54,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:54,600 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:54,600 INFO L427 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-02-10 20:44:54,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:54,600 INFO L82 PathProgramCache]: Analyzing trace with hash 888472687, now seen corresponding path program 436 times [2020-02-10 20:44:54,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:54,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46444458] [2020-02-10 20:44:54,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:55,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46444458] [2020-02-10 20:44:55,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:55,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:55,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725511772] [2020-02-10 20:44:55,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:55,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:55,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:55,011 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:44:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:55,191 INFO L93 Difference]: Finished difference Result 1463 states and 5098 transitions. [2020-02-10 20:44:55,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:55,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:55,195 INFO L225 Difference]: With dead ends: 1463 [2020-02-10 20:44:55,195 INFO L226 Difference]: Without dead ends: 1445 [2020-02-10 20:44:55,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:55,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2020-02-10 20:44:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 795. [2020-02-10 20:44:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:44:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-02-10 20:44:55,219 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-02-10 20:44:55,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:55,219 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-02-10 20:44:55,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-02-10 20:44:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:55,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:55,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-02-10 20:44:55,220 INFO L427 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-02-10 20:44:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:55,220 INFO L82 PathProgramCache]: Analyzing trace with hash -58246861, now seen corresponding path program 437 times [2020-02-10 20:44:55,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:55,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429285483] [2020-02-10 20:44:55,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:55,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429285483] [2020-02-10 20:44:55,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:55,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:55,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255680008] [2020-02-10 20:44:55,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:55,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:55,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:55,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:55,619 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:44:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:55,755 INFO L93 Difference]: Finished difference Result 1469 states and 5111 transitions. [2020-02-10 20:44:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:55,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:55,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:55,759 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 20:44:55,759 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 20:44:55,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:55,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 20:44:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 800. [2020-02-10 20:44:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:44:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3165 transitions. [2020-02-10 20:44:55,783 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3165 transitions. Word has length 25 [2020-02-10 20:44:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:55,783 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3165 transitions. [2020-02-10 20:44:55,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3165 transitions. [2020-02-10 20:44:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:55,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:55,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-02-10 20:44:55,785 INFO L427 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-02-10 20:44:55,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:55,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1552694097, now seen corresponding path program 438 times [2020-02-10 20:44:55,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:55,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882387928] [2020-02-10 20:44:55,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:56,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882387928] [2020-02-10 20:44:56,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:56,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:56,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102091371] [2020-02-10 20:44:56,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:56,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:56,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:56,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:56,184 INFO L87 Difference]: Start difference. First operand 800 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:44:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:56,339 INFO L93 Difference]: Finished difference Result 1467 states and 5102 transitions. [2020-02-10 20:44:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:56,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:56,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:56,344 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 20:44:56,344 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:44:56,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-02-10 20:44:56,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:44:56,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 791. [2020-02-10 20:44:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:44:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-02-10 20:44:56,368 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-02-10 20:44:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:56,368 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-02-10 20:44:56,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-02-10 20:44:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:56,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:56,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-02-10 20:44:56,369 INFO L427 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-02-10 20:44:56,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:56,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1833159253, now seen corresponding path program 439 times [2020-02-10 20:44:56,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:56,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116669983] [2020-02-10 20:44:56,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:56,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116669983] [2020-02-10 20:44:56,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:56,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:56,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041310171] [2020-02-10 20:44:56,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:56,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:56,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:56,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:56,779 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:44:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:56,933 INFO L93 Difference]: Finished difference Result 1475 states and 5127 transitions. [2020-02-10 20:44:56,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:56,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:56,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:56,936 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 20:44:56,936 INFO L226 Difference]: Without dead ends: 1462 [2020-02-10 20:44:56,936 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:56,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-02-10 20:44:56,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 801. [2020-02-10 20:44:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:44:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3172 transitions. [2020-02-10 20:44:56,960 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3172 transitions. Word has length 25 [2020-02-10 20:44:56,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:56,960 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3172 transitions. [2020-02-10 20:44:56,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3172 transitions. [2020-02-10 20:44:56,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:56,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:56,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-02-10 20:44:56,961 INFO L427 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-02-10 20:44:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:56,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1470550221, now seen corresponding path program 440 times [2020-02-10 20:44:56,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:56,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820188877] [2020-02-10 20:44:56,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:57,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820188877] [2020-02-10 20:44:57,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:57,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:57,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432604361] [2020-02-10 20:44:57,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:57,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:57,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:57,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:57,370 INFO L87 Difference]: Start difference. First operand 801 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:44:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:57,513 INFO L93 Difference]: Finished difference Result 1478 states and 5129 transitions. [2020-02-10 20:44:57,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:57,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:57,518 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 20:44:57,518 INFO L226 Difference]: Without dead ends: 1458 [2020-02-10 20:44:57,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-02-10 20:44:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2020-02-10 20:44:57,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 797. [2020-02-10 20:44:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:44:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-02-10 20:44:57,544 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-02-10 20:44:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:57,544 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-02-10 20:44:57,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-02-10 20:44:57,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:57,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:57,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-02-10 20:44:57,546 INFO L427 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-02-10 20:44:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1390260113, now seen corresponding path program 441 times [2020-02-10 20:44:57,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:57,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493044778] [2020-02-10 20:44:57,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:57,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493044778] [2020-02-10 20:44:57,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:57,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:57,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970181200] [2020-02-10 20:44:57,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:57,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:57,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:57,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:57,950 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:44:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:58,131 INFO L93 Difference]: Finished difference Result 1478 states and 5128 transitions. [2020-02-10 20:44:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:58,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:58,136 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 20:44:58,137 INFO L226 Difference]: Without dead ends: 1465 [2020-02-10 20:44:58,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-02-10 20:44:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-02-10 20:44:58,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 802. [2020-02-10 20:44:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:44:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3170 transitions. [2020-02-10 20:44:58,169 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3170 transitions. Word has length 25 [2020-02-10 20:44:58,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:58,169 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3170 transitions. [2020-02-10 20:44:58,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3170 transitions. [2020-02-10 20:44:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:58,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:58,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-02-10 20:44:58,170 INFO L427 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-02-10 20:44:58,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1892443153, now seen corresponding path program 442 times [2020-02-10 20:44:58,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:58,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744236060] [2020-02-10 20:44:58,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:58,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744236060] [2020-02-10 20:44:58,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:58,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:58,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510770969] [2020-02-10 20:44:58,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:58,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:58,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:58,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:58,589 INFO L87 Difference]: Start difference. First operand 802 states and 3170 transitions. Second operand 10 states. [2020-02-10 20:44:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:58,710 INFO L93 Difference]: Finished difference Result 1483 states and 5133 transitions. [2020-02-10 20:44:58,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:58,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:58,714 INFO L225 Difference]: With dead ends: 1483 [2020-02-10 20:44:58,714 INFO L226 Difference]: Without dead ends: 1460 [2020-02-10 20:44:58,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-02-10 20:44:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 797. [2020-02-10 20:44:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:44:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3156 transitions. [2020-02-10 20:44:58,739 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3156 transitions. Word has length 25 [2020-02-10 20:44:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:58,739 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3156 transitions. [2020-02-10 20:44:58,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3156 transitions. [2020-02-10 20:44:58,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:58,740 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:58,740 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:44:58,740 INFO L427 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-02-10 20:44:58,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:58,740 INFO L82 PathProgramCache]: Analyzing trace with hash -155136363, now seen corresponding path program 443 times [2020-02-10 20:44:58,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:58,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590981131] [2020-02-10 20:44:58,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:59,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590981131] [2020-02-10 20:44:59,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:59,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:59,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790939177] [2020-02-10 20:44:59,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:59,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:59,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:59,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:59,158 INFO L87 Difference]: Start difference. First operand 797 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:44:59,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:59,310 INFO L93 Difference]: Finished difference Result 1488 states and 5145 transitions. [2020-02-10 20:44:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:59,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:59,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:59,314 INFO L225 Difference]: With dead ends: 1488 [2020-02-10 20:44:59,314 INFO L226 Difference]: Without dead ends: 1472 [2020-02-10 20:44:59,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-02-10 20:44:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2020-02-10 20:44:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 806. [2020-02-10 20:44:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-02-10 20:44:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3172 transitions. [2020-02-10 20:44:59,338 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3172 transitions. Word has length 25 [2020-02-10 20:44:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:59,339 INFO L479 AbstractCegarLoop]: Abstraction has 806 states and 3172 transitions. [2020-02-10 20:44:59,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3172 transitions. [2020-02-10 20:44:59,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:59,340 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:59,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-02-10 20:44:59,340 INFO L427 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-02-10 20:44:59,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:59,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1228221743, now seen corresponding path program 444 times [2020-02-10 20:44:59,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:59,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327263683] [2020-02-10 20:44:59,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:44:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:44:59,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327263683] [2020-02-10 20:44:59,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:44:59,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:44:59,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087985775] [2020-02-10 20:44:59,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:44:59,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:44:59,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:44:59,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:44:59,770 INFO L87 Difference]: Start difference. First operand 806 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:44:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:44:59,913 INFO L93 Difference]: Finished difference Result 1490 states and 5141 transitions. [2020-02-10 20:44:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:44:59,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:44:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:44:59,917 INFO L225 Difference]: With dead ends: 1490 [2020-02-10 20:44:59,917 INFO L226 Difference]: Without dead ends: 1457 [2020-02-10 20:44:59,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:44:59,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-02-10 20:44:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 791. [2020-02-10 20:44:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:44:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3139 transitions. [2020-02-10 20:44:59,941 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3139 transitions. Word has length 25 [2020-02-10 20:44:59,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:44:59,942 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3139 transitions. [2020-02-10 20:44:59,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:44:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3139 transitions. [2020-02-10 20:44:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:44:59,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:44:59,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-02-10 20:44:59,943 INFO L427 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-02-10 20:44:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:44:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash -958259691, now seen corresponding path program 445 times [2020-02-10 20:44:59,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:44:59,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726860969] [2020-02-10 20:44:59,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:44:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45: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-02-10 20:45:00,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726860969] [2020-02-10 20:45:00,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:00,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:00,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527251024] [2020-02-10 20:45:00,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:00,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:00,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:00,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:00,352 INFO L87 Difference]: Start difference. First operand 791 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:45:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:00,527 INFO L93 Difference]: Finished difference Result 1467 states and 5104 transitions. [2020-02-10 20:45:00,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:00,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:00,531 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 20:45:00,531 INFO L226 Difference]: Without dead ends: 1454 [2020-02-10 20:45:00,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-02-10 20:45:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-02-10 20:45:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 800. [2020-02-10 20:45:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:45:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3164 transitions. [2020-02-10 20:45:00,555 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3164 transitions. Word has length 25 [2020-02-10 20:45:00,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:00,555 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3164 transitions. [2020-02-10 20:45:00,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:00,556 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3164 transitions. [2020-02-10 20:45:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:00,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:00,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-02-10 20:45:00,557 INFO L427 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-02-10 20:45:00,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:00,557 INFO L82 PathProgramCache]: Analyzing trace with hash 43501235, now seen corresponding path program 446 times [2020-02-10 20:45:00,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:00,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056146020] [2020-02-10 20:45:00,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45: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-02-10 20:45:00,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056146020] [2020-02-10 20:45:00,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:00,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:00,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590715336] [2020-02-10 20:45:00,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:00,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:00,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:00,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:00,981 INFO L87 Difference]: Start difference. First operand 800 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:45:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:01,133 INFO L93 Difference]: Finished difference Result 1468 states and 5102 transitions. [2020-02-10 20:45:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:01,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:01,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:01,138 INFO L225 Difference]: With dead ends: 1468 [2020-02-10 20:45:01,138 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 20:45:01,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 20:45:01,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 796. [2020-02-10 20:45:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:45:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3153 transitions. [2020-02-10 20:45:01,162 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3153 transitions. Word has length 25 [2020-02-10 20:45:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:01,162 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3153 transitions. [2020-02-10 20:45:01,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3153 transitions. [2020-02-10 20:45:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:01,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:01,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-02-10 20:45:01,163 INFO L427 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-02-10 20:45:01,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:01,164 INFO L82 PathProgramCache]: Analyzing trace with hash 967774387, now seen corresponding path program 447 times [2020-02-10 20:45:01,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:01,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861894766] [2020-02-10 20:45:01,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:01,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861894766] [2020-02-10 20:45:01,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:01,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:01,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336420428] [2020-02-10 20:45:01,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:01,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:01,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:01,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:01,566 INFO L87 Difference]: Start difference. First operand 796 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:45:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:01,724 INFO L93 Difference]: Finished difference Result 1472 states and 5109 transitions. [2020-02-10 20:45:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:01,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:01,728 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 20:45:01,728 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 20:45:01,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:01,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 20:45:01,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 801. [2020-02-10 20:45:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:45:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3162 transitions. [2020-02-10 20:45:01,753 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3162 transitions. Word has length 25 [2020-02-10 20:45:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:01,753 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3162 transitions. [2020-02-10 20:45:01,753 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3162 transitions. [2020-02-10 20:45:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:01,754 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:01,754 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:01,755 INFO L427 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-02-10 20:45:01,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:01,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1980038417, now seen corresponding path program 448 times [2020-02-10 20:45:01,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:01,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504972348] [2020-02-10 20:45:01,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:02,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504972348] [2020-02-10 20:45:02,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:02,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:02,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924795507] [2020-02-10 20:45:02,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:02,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:02,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:02,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:02,170 INFO L87 Difference]: Start difference. First operand 801 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:45:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:02,328 INFO L93 Difference]: Finished difference Result 1477 states and 5114 transitions. [2020-02-10 20:45:02,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:02,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:02,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:02,333 INFO L225 Difference]: With dead ends: 1477 [2020-02-10 20:45:02,333 INFO L226 Difference]: Without dead ends: 1454 [2020-02-10 20:45:02,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-02-10 20:45:02,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-02-10 20:45:02,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 796. [2020-02-10 20:45:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:45:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-02-10 20:45:02,357 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-02-10 20:45:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:02,357 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-02-10 20:45:02,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-02-10 20:45:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:02,359 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:02,359 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:02,359 INFO L427 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-02-10 20:45:02,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:02,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1358915093, now seen corresponding path program 449 times [2020-02-10 20:45:02,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:02,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670514677] [2020-02-10 20:45:02,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:02,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670514677] [2020-02-10 20:45:02,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:02,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:02,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557454611] [2020-02-10 20:45:02,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:02,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:02,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:02,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:02,766 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:45:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:02,926 INFO L93 Difference]: Finished difference Result 1475 states and 5111 transitions. [2020-02-10 20:45:02,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:02,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:02,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:02,930 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 20:45:02,930 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 20:45:02,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-02-10 20:45:02,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 20:45:02,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 802. [2020-02-10 20:45:02,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:45:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3159 transitions. [2020-02-10 20:45:02,954 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3159 transitions. Word has length 25 [2020-02-10 20:45:02,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:02,955 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3159 transitions. [2020-02-10 20:45:02,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:02,955 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3159 transitions. [2020-02-10 20:45:02,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:02,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:02,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-02-10 20:45:02,956 INFO L427 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-02-10 20:45:02,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:02,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1325111245, now seen corresponding path program 450 times [2020-02-10 20:45:02,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:02,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60308701] [2020-02-10 20:45:02,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:03,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60308701] [2020-02-10 20:45:03,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:03,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:03,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527187435] [2020-02-10 20:45:03,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:03,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:03,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:03,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:03,381 INFO L87 Difference]: Start difference. First operand 802 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:45:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:03,536 INFO L93 Difference]: Finished difference Result 1479 states and 5113 transitions. [2020-02-10 20:45:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:03,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:03,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:03,540 INFO L225 Difference]: With dead ends: 1479 [2020-02-10 20:45:03,540 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 20:45:03,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-02-10 20:45:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 20:45:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 791. [2020-02-10 20:45:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:45:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3134 transitions. [2020-02-10 20:45:03,565 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3134 transitions. Word has length 25 [2020-02-10 20:45:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:03,565 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3134 transitions. [2020-02-10 20:45:03,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3134 transitions. [2020-02-10 20:45:03,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:03,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:03,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:03,566 INFO L427 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-02-10 20:45:03,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:03,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2064877073, now seen corresponding path program 451 times [2020-02-10 20:45:03,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:03,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007701641] [2020-02-10 20:45:03,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:03,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:03,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007701641] [2020-02-10 20:45:03,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:03,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:03,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290760272] [2020-02-10 20:45:03,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:03,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:03,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:03,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:03,986 INFO L87 Difference]: Start difference. First operand 791 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:45:04,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:04,153 INFO L93 Difference]: Finished difference Result 1484 states and 5139 transitions. [2020-02-10 20:45:04,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:04,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:04,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:04,157 INFO L225 Difference]: With dead ends: 1484 [2020-02-10 20:45:04,157 INFO L226 Difference]: Without dead ends: 1468 [2020-02-10 20:45:04,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:04,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-02-10 20:45:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 803. [2020-02-10 20:45:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:45:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3167 transitions. [2020-02-10 20:45:04,183 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3167 transitions. Word has length 25 [2020-02-10 20:45:04,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:04,184 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3167 transitions. [2020-02-10 20:45:04,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:04,184 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3167 transitions. [2020-02-10 20:45:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:04,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:04,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-02-10 20:45:04,185 INFO L427 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-02-10 20:45:04,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:04,185 INFO L82 PathProgramCache]: Analyzing trace with hash -619149265, now seen corresponding path program 452 times [2020-02-10 20:45:04,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:04,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797151880] [2020-02-10 20:45:04,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:04,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797151880] [2020-02-10 20:45:04,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:04,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:04,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899094504] [2020-02-10 20:45:04,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:04,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:04,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:04,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:04,604 INFO L87 Difference]: Start difference. First operand 803 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:45:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:04,789 INFO L93 Difference]: Finished difference Result 1482 states and 5130 transitions. [2020-02-10 20:45:04,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:04,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:04,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:04,793 INFO L225 Difference]: With dead ends: 1482 [2020-02-10 20:45:04,794 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 20:45:04,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:04,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 20:45:04,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 798. [2020-02-10 20:45:04,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:45:04,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3153 transitions. [2020-02-10 20:45:04,818 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3153 transitions. Word has length 25 [2020-02-10 20:45:04,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:04,818 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3153 transitions. [2020-02-10 20:45:04,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:04,818 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3153 transitions. [2020-02-10 20:45:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:04,819 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:04,819 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:04,819 INFO L427 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-02-10 20:45:04,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:04,819 INFO L82 PathProgramCache]: Analyzing trace with hash 464439219, now seen corresponding path program 453 times [2020-02-10 20:45:04,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:04,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244949558] [2020-02-10 20:45:04,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:05,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244949558] [2020-02-10 20:45:05,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:05,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:05,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197521390] [2020-02-10 20:45:05,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:05,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:05,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:05,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:05,236 INFO L87 Difference]: Start difference. First operand 798 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:45:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:05,401 INFO L93 Difference]: Finished difference Result 1492 states and 5150 transitions. [2020-02-10 20:45:05,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:05,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:05,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:05,405 INFO L225 Difference]: With dead ends: 1492 [2020-02-10 20:45:05,405 INFO L226 Difference]: Without dead ends: 1476 [2020-02-10 20:45:05,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-02-10 20:45:05,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-02-10 20:45:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 807. [2020-02-10 20:45:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:45:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3169 transitions. [2020-02-10 20:45:05,429 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3169 transitions. Word has length 25 [2020-02-10 20:45:05,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:05,430 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3169 transitions. [2020-02-10 20:45:05,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3169 transitions. [2020-02-10 20:45:05,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:05,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:05,431 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:05,431 INFO L427 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-02-10 20:45:05,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:05,431 INFO L82 PathProgramCache]: Analyzing trace with hash -608646161, now seen corresponding path program 454 times [2020-02-10 20:45:05,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:05,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072205161] [2020-02-10 20:45:05,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:05,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072205161] [2020-02-10 20:45:05,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:05,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:05,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28564163] [2020-02-10 20:45:05,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:05,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:05,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:05,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:05,854 INFO L87 Difference]: Start difference. First operand 807 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:45:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:06,000 INFO L93 Difference]: Finished difference Result 1494 states and 5146 transitions. [2020-02-10 20:45:06,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:06,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:06,004 INFO L225 Difference]: With dead ends: 1494 [2020-02-10 20:45:06,004 INFO L226 Difference]: Without dead ends: 1467 [2020-02-10 20:45:06,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:06,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-02-10 20:45:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 798. [2020-02-10 20:45:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:45:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3146 transitions. [2020-02-10 20:45:06,029 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3146 transitions. Word has length 25 [2020-02-10 20:45:06,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:06,029 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3146 transitions. [2020-02-10 20:45:06,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:06,029 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3146 transitions. [2020-02-10 20:45:06,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:06,030 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:06,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-02-10 20:45:06,030 INFO L427 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-02-10 20:45:06,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:06,030 INFO L82 PathProgramCache]: Analyzing trace with hash 474942323, now seen corresponding path program 455 times [2020-02-10 20:45:06,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:06,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238797804] [2020-02-10 20:45:06,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:06,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-02-10 20:45:06,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238797804] [2020-02-10 20:45:06,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:06,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:06,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607228951] [2020-02-10 20:45:06,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:06,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:06,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:06,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:06,441 INFO L87 Difference]: Start difference. First operand 798 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:45:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:06,612 INFO L93 Difference]: Finished difference Result 1485 states and 5128 transitions. [2020-02-10 20:45:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:06,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:06,616 INFO L225 Difference]: With dead ends: 1485 [2020-02-10 20:45:06,616 INFO L226 Difference]: Without dead ends: 1471 [2020-02-10 20:45:06,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-02-10 20:45:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 804. [2020-02-10 20:45:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:45:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3157 transitions. [2020-02-10 20:45:06,640 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3157 transitions. Word has length 25 [2020-02-10 20:45:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:06,640 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3157 transitions. [2020-02-10 20:45:06,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3157 transitions. [2020-02-10 20:45:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:06,641 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:06,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-02-10 20:45:06,641 INFO L427 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-02-10 20:45:06,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:06,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2085883281, now seen corresponding path program 456 times [2020-02-10 20:45:06,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:06,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083340096] [2020-02-10 20:45:06,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:07,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083340096] [2020-02-10 20:45:07,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:07,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:07,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742741068] [2020-02-10 20:45:07,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:07,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:07,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:07,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:07,059 INFO L87 Difference]: Start difference. First operand 804 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:45:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:07,195 INFO L93 Difference]: Finished difference Result 1489 states and 5130 transitions. [2020-02-10 20:45:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:07,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:07,199 INFO L225 Difference]: With dead ends: 1489 [2020-02-10 20:45:07,199 INFO L226 Difference]: Without dead ends: 1452 [2020-02-10 20:45:07,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-02-10 20:45:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 785. [2020-02-10 20:45:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:45:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3117 transitions. [2020-02-10 20:45:07,222 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3117 transitions. Word has length 25 [2020-02-10 20:45:07,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:07,223 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3117 transitions. [2020-02-10 20:45:07,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3117 transitions. [2020-02-10 20:45:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:07,224 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:07,224 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:07,224 INFO L427 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-02-10 20:45:07,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:07,224 INFO L82 PathProgramCache]: Analyzing trace with hash -128929703, now seen corresponding path program 457 times [2020-02-10 20:45:07,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:07,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958616415] [2020-02-10 20:45:07,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:07,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958616415] [2020-02-10 20:45:07,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:07,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:07,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235237149] [2020-02-10 20:45:07,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:07,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:07,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:07,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:07,642 INFO L87 Difference]: Start difference. First operand 785 states and 3117 transitions. Second operand 10 states. [2020-02-10 20:45:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:07,809 INFO L93 Difference]: Finished difference Result 1491 states and 5177 transitions. [2020-02-10 20:45:07,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:07,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:07,814 INFO L225 Difference]: With dead ends: 1491 [2020-02-10 20:45:07,814 INFO L226 Difference]: Without dead ends: 1476 [2020-02-10 20:45:07,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:07,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-02-10 20:45:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 805. [2020-02-10 20:45:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 20:45:07,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3181 transitions. [2020-02-10 20:45:07,841 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3181 transitions. Word has length 25 [2020-02-10 20:45:07,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:07,841 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3181 transitions. [2020-02-10 20:45:07,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:07,841 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3181 transitions. [2020-02-10 20:45:07,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:07,842 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:07,842 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:07,842 INFO L427 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-02-10 20:45:07,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:07,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1202015083, now seen corresponding path program 458 times [2020-02-10 20:45:07,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:07,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520195322] [2020-02-10 20:45:07,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:08,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520195322] [2020-02-10 20:45:08,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:08,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:08,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726202710] [2020-02-10 20:45:08,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:08,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:08,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:08,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:08,299 INFO L87 Difference]: Start difference. First operand 805 states and 3181 transitions. Second operand 10 states. [2020-02-10 20:45:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:08,457 INFO L93 Difference]: Finished difference Result 1492 states and 5173 transitions. [2020-02-10 20:45:08,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:08,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:08,474 INFO L225 Difference]: With dead ends: 1492 [2020-02-10 20:45:08,474 INFO L226 Difference]: Without dead ends: 1470 [2020-02-10 20:45:08,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2020-02-10 20:45:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 799. [2020-02-10 20:45:08,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:45:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3165 transitions. [2020-02-10 20:45:08,497 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3165 transitions. Word has length 25 [2020-02-10 20:45:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:08,497 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3165 transitions. [2020-02-10 20:45:08,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3165 transitions. [2020-02-10 20:45:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:08,499 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:08,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:08,499 INFO L427 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-02-10 20:45:08,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:08,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1729367557, now seen corresponding path program 459 times [2020-02-10 20:45:08,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:08,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006511029] [2020-02-10 20:45:08,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:08,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006511029] [2020-02-10 20:45:08,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:08,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:08,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661188358] [2020-02-10 20:45:08,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:08,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:08,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:08,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:08,915 INFO L87 Difference]: Start difference. First operand 799 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:45:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:09,069 INFO L93 Difference]: Finished difference Result 1488 states and 5165 transitions. [2020-02-10 20:45:09,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:09,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:09,074 INFO L225 Difference]: With dead ends: 1488 [2020-02-10 20:45:09,074 INFO L226 Difference]: Without dead ends: 1473 [2020-02-10 20:45:09,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:09,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-02-10 20:45:09,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 804. [2020-02-10 20:45:09,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:45:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3174 transitions. [2020-02-10 20:45:09,099 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3174 transitions. Word has length 25 [2020-02-10 20:45:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:09,099 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3174 transitions. [2020-02-10 20:45:09,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3174 transitions. [2020-02-10 20:45:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:09,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:09,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:09,100 INFO L427 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-02-10 20:45:09,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:09,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1191511979, now seen corresponding path program 460 times [2020-02-10 20:45:09,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:09,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865496224] [2020-02-10 20:45:09,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:09,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865496224] [2020-02-10 20:45:09,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:09,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:09,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080900414] [2020-02-10 20:45:09,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:09,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:09,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:09,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:09,513 INFO L87 Difference]: Start difference. First operand 804 states and 3174 transitions. Second operand 10 states. [2020-02-10 20:45:09,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:09,649 INFO L93 Difference]: Finished difference Result 1487 states and 5158 transitions. [2020-02-10 20:45:09,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:09,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:09,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:09,653 INFO L225 Difference]: With dead ends: 1487 [2020-02-10 20:45:09,653 INFO L226 Difference]: Without dead ends: 1468 [2020-02-10 20:45:09,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-02-10 20:45:09,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-02-10 20:45:09,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 799. [2020-02-10 20:45:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:45:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3160 transitions. [2020-02-10 20:45:09,677 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3160 transitions. Word has length 25 [2020-02-10 20:45:09,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:09,678 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3160 transitions. [2020-02-10 20:45:09,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:09,678 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3160 transitions. [2020-02-10 20:45:09,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:09,679 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:09,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-02-10 20:45:09,679 INFO L427 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-02-10 20:45:09,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:09,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1708361349, now seen corresponding path program 461 times [2020-02-10 20:45:09,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:09,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985032566] [2020-02-10 20:45:09,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:10,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-02-10 20:45:10,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985032566] [2020-02-10 20:45:10,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:10,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:10,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154107729] [2020-02-10 20:45:10,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:10,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:10,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:10,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:10,091 INFO L87 Difference]: Start difference. First operand 799 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:45:10,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:10,257 INFO L93 Difference]: Finished difference Result 1490 states and 5164 transitions. [2020-02-10 20:45:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:10,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:10,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:10,261 INFO L225 Difference]: With dead ends: 1490 [2020-02-10 20:45:10,261 INFO L226 Difference]: Without dead ends: 1474 [2020-02-10 20:45:10,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-02-10 20:45:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2020-02-10 20:45:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 804. [2020-02-10 20:45:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:45:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3169 transitions. [2020-02-10 20:45:10,285 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3169 transitions. Word has length 25 [2020-02-10 20:45:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:10,285 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3169 transitions. [2020-02-10 20:45:10,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3169 transitions. [2020-02-10 20:45:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:10,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:10,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:10,286 INFO L427 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-02-10 20:45:10,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:10,286 INFO L82 PathProgramCache]: Analyzing trace with hash -97420391, now seen corresponding path program 462 times [2020-02-10 20:45:10,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:10,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622875125] [2020-02-10 20:45:10,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:10,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622875125] [2020-02-10 20:45:10,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:10,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:10,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590429186] [2020-02-10 20:45:10,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:10,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:10,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:10,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:10,703 INFO L87 Difference]: Start difference. First operand 804 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:45:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:10,849 INFO L93 Difference]: Finished difference Result 1488 states and 5155 transitions. [2020-02-10 20:45:10,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:10,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:10,853 INFO L225 Difference]: With dead ends: 1488 [2020-02-10 20:45:10,853 INFO L226 Difference]: Without dead ends: 1464 [2020-02-10 20:45:10,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2020-02-10 20:45:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 794. [2020-02-10 20:45:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:45:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-02-10 20:45:10,878 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-02-10 20:45:10,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:10,878 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-02-10 20:45:10,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-02-10 20:45:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:10,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:10,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-02-10 20:45:10,880 INFO L427 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-02-10 20:45:10,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:10,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1797104375, now seen corresponding path program 463 times [2020-02-10 20:45:10,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:10,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706011216] [2020-02-10 20:45:10,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:11,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706011216] [2020-02-10 20:45:11,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:11,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:11,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385546361] [2020-02-10 20:45:11,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:11,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:11,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:11,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:11,311 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:45:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:11,458 INFO L93 Difference]: Finished difference Result 1505 states and 5203 transitions. [2020-02-10 20:45:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:11,459 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:11,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:11,462 INFO L225 Difference]: With dead ends: 1505 [2020-02-10 20:45:11,463 INFO L226 Difference]: Without dead ends: 1490 [2020-02-10 20:45:11,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2020-02-10 20:45:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 809. [2020-02-10 20:45:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2020-02-10 20:45:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 3186 transitions. [2020-02-10 20:45:11,488 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 3186 transitions. Word has length 25 [2020-02-10 20:45:11,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:11,488 INFO L479 AbstractCegarLoop]: Abstraction has 809 states and 3186 transitions. [2020-02-10 20:45:11,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 3186 transitions. [2020-02-10 20:45:11,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:11,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:11,489 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:11,490 INFO L427 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-02-10 20:45:11,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:11,490 INFO L82 PathProgramCache]: Analyzing trace with hash 724018995, now seen corresponding path program 464 times [2020-02-10 20:45:11,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:11,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075716879] [2020-02-10 20:45:11,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:11,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075716879] [2020-02-10 20:45:11,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:11,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:11,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186697460] [2020-02-10 20:45:11,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:11,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:11,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:11,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:11,927 INFO L87 Difference]: Start difference. First operand 809 states and 3186 transitions. Second operand 10 states. [2020-02-10 20:45:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:12,088 INFO L93 Difference]: Finished difference Result 1506 states and 5199 transitions. [2020-02-10 20:45:12,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:12,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:12,092 INFO L225 Difference]: With dead ends: 1506 [2020-02-10 20:45:12,093 INFO L226 Difference]: Without dead ends: 1484 [2020-02-10 20:45:12,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-02-10 20:45:12,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-02-10 20:45:12,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 803. [2020-02-10 20:45:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:45:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3169 transitions. [2020-02-10 20:45:12,118 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3169 transitions. Word has length 25 [2020-02-10 20:45:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:12,119 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3169 transitions. [2020-02-10 20:45:12,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3169 transitions. [2020-02-10 20:45:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:12,120 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:12,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-02-10 20:45:12,120 INFO L427 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-02-10 20:45:12,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1403771333, now seen corresponding path program 465 times [2020-02-10 20:45:12,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:12,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083433639] [2020-02-10 20:45:12,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:12,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083433639] [2020-02-10 20:45:12,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:12,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:12,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842533641] [2020-02-10 20:45:12,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:12,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:12,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:12,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:12,551 INFO L87 Difference]: Start difference. First operand 803 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:45:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:12,685 INFO L93 Difference]: Finished difference Result 1508 states and 5202 transitions. [2020-02-10 20:45:12,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:12,686 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:12,689 INFO L225 Difference]: With dead ends: 1508 [2020-02-10 20:45:12,690 INFO L226 Difference]: Without dead ends: 1493 [2020-02-10 20:45:12,690 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2020-02-10 20:45:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 810. [2020-02-10 20:45:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-02-10 20:45:12,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3182 transitions. [2020-02-10 20:45:12,714 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3182 transitions. Word has length 25 [2020-02-10 20:45:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:12,715 INFO L479 AbstractCegarLoop]: Abstraction has 810 states and 3182 transitions. [2020-02-10 20:45:12,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3182 transitions. [2020-02-10 20:45:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:12,716 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:12,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-02-10 20:45:12,716 INFO L427 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-02-10 20:45:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:12,716 INFO L82 PathProgramCache]: Analyzing trace with hash 745025203, now seen corresponding path program 466 times [2020-02-10 20:45:12,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:12,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123993357] [2020-02-10 20:45:12,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:13,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123993357] [2020-02-10 20:45:13,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:13,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:13,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111321096] [2020-02-10 20:45:13,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:13,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:13,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:13,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:13,140 INFO L87 Difference]: Start difference. First operand 810 states and 3182 transitions. Second operand 10 states. [2020-02-10 20:45:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:13,271 INFO L93 Difference]: Finished difference Result 1511 states and 5201 transitions. [2020-02-10 20:45:13,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:13,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:13,276 INFO L225 Difference]: With dead ends: 1511 [2020-02-10 20:45:13,276 INFO L226 Difference]: Without dead ends: 1486 [2020-02-10 20:45:13,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2020-02-10 20:45:13,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 803. [2020-02-10 20:45:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:45:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3162 transitions. [2020-02-10 20:45:13,301 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3162 transitions. Word has length 25 [2020-02-10 20:45:13,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:13,301 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3162 transitions. [2020-02-10 20:45:13,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3162 transitions. [2020-02-10 20:45:13,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:13,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:13,302 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:13,302 INFO L427 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-02-10 20:45:13,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:13,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1382765125, now seen corresponding path program 467 times [2020-02-10 20:45:13,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:13,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764495019] [2020-02-10 20:45:13,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:13,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764495019] [2020-02-10 20:45:13,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:13,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:13,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170003858] [2020-02-10 20:45:13,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:13,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:13,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:13,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:13,725 INFO L87 Difference]: Start difference. First operand 803 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:45:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:13,870 INFO L93 Difference]: Finished difference Result 1512 states and 5203 transitions. [2020-02-10 20:45:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:13,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:13,874 INFO L225 Difference]: With dead ends: 1512 [2020-02-10 20:45:13,874 INFO L226 Difference]: Without dead ends: 1496 [2020-02-10 20:45:13,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2020-02-10 20:45:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 812. [2020-02-10 20:45:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-02-10 20:45:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 3178 transitions. [2020-02-10 20:45:13,898 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 3178 transitions. Word has length 25 [2020-02-10 20:45:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:13,898 INFO L479 AbstractCegarLoop]: Abstraction has 812 states and 3178 transitions. [2020-02-10 20:45:13,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 3178 transitions. [2020-02-10 20:45:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:13,899 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:13,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-02-10 20:45:13,900 INFO L427 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-02-10 20:45:13,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:13,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1839116791, now seen corresponding path program 468 times [2020-02-10 20:45:13,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:13,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779638215] [2020-02-10 20:45:13,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:14,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779638215] [2020-02-10 20:45:14,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:14,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:14,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721024690] [2020-02-10 20:45:14,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:14,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:14,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:14,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:14,354 INFO L87 Difference]: Start difference. First operand 812 states and 3178 transitions. Second operand 10 states. [2020-02-10 20:45:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:14,497 INFO L93 Difference]: Finished difference Result 1514 states and 5199 transitions. [2020-02-10 20:45:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:14,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:14,502 INFO L225 Difference]: With dead ends: 1514 [2020-02-10 20:45:14,502 INFO L226 Difference]: Without dead ends: 1478 [2020-02-10 20:45:14,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:14,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-02-10 20:45:14,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 794. [2020-02-10 20:45:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:45:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3138 transitions. [2020-02-10 20:45:14,526 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3138 transitions. Word has length 25 [2020-02-10 20:45:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:14,527 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3138 transitions. [2020-02-10 20:45:14,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3138 transitions. [2020-02-10 20:45:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:14,528 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:14,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-02-10 20:45:14,528 INFO L427 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-02-10 20:45:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:14,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2122700599, now seen corresponding path program 469 times [2020-02-10 20:45:14,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:14,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663710982] [2020-02-10 20:45:14,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:14,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663710982] [2020-02-10 20:45:14,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:14,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:14,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645141717] [2020-02-10 20:45:14,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:14,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:14,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:14,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:14,946 INFO L87 Difference]: Start difference. First operand 794 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:45:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:15,121 INFO L93 Difference]: Finished difference Result 1493 states and 5167 transitions. [2020-02-10 20:45:15,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:15,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:15,125 INFO L225 Difference]: With dead ends: 1493 [2020-02-10 20:45:15,125 INFO L226 Difference]: Without dead ends: 1478 [2020-02-10 20:45:15,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-02-10 20:45:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-02-10 20:45:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 805. [2020-02-10 20:45:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 20:45:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3169 transitions. [2020-02-10 20:45:15,150 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3169 transitions. Word has length 25 [2020-02-10 20:45:15,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:15,150 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3169 transitions. [2020-02-10 20:45:15,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3169 transitions. [2020-02-10 20:45:15,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:15,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:15,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:15,151 INFO L427 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-02-10 20:45:15,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:15,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1634411119, now seen corresponding path program 470 times [2020-02-10 20:45:15,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:15,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637578670] [2020-02-10 20:45:15,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:15,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637578670] [2020-02-10 20:45:15,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:15,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:15,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529925994] [2020-02-10 20:45:15,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:15,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:15,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:15,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:15,596 INFO L87 Difference]: Start difference. First operand 805 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:45:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:15,739 INFO L93 Difference]: Finished difference Result 1492 states and 5160 transitions. [2020-02-10 20:45:15,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:15,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:15,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:15,743 INFO L225 Difference]: With dead ends: 1492 [2020-02-10 20:45:15,744 INFO L226 Difference]: Without dead ends: 1473 [2020-02-10 20:45:15,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-02-10 20:45:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-02-10 20:45:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 800. [2020-02-10 20:45:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:45:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3155 transitions. [2020-02-10 20:45:15,769 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3155 transitions. Word has length 25 [2020-02-10 20:45:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:15,769 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3155 transitions. [2020-02-10 20:45:15,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3155 transitions. [2020-02-10 20:45:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:15,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:15,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-02-10 20:45:15,770 INFO L427 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-02-10 20:45:15,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:15,770 INFO L82 PathProgramCache]: Analyzing trace with hash 522262745, now seen corresponding path program 471 times [2020-02-10 20:45:15,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:15,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657996812] [2020-02-10 20:45:15,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:16,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:16,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657996812] [2020-02-10 20:45:16,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:16,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:16,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525201029] [2020-02-10 20:45:16,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:16,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:16,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:16,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:16,183 INFO L87 Difference]: Start difference. First operand 800 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:45:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:16,325 INFO L93 Difference]: Finished difference Result 1499 states and 5174 transitions. [2020-02-10 20:45:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:16,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:16,329 INFO L225 Difference]: With dead ends: 1499 [2020-02-10 20:45:16,330 INFO L226 Difference]: Without dead ends: 1484 [2020-02-10 20:45:16,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-02-10 20:45:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-02-10 20:45:16,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 807. [2020-02-10 20:45:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:45:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3168 transitions. [2020-02-10 20:45:16,355 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3168 transitions. Word has length 25 [2020-02-10 20:45:16,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:16,355 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3168 transitions. [2020-02-10 20:45:16,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3168 transitions. [2020-02-10 20:45:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:16,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:16,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-02-10 20:45:16,356 INFO L427 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-02-10 20:45:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1623908015, now seen corresponding path program 472 times [2020-02-10 20:45:16,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:16,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876431289] [2020-02-10 20:45:16,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:16,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876431289] [2020-02-10 20:45:16,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:16,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:16,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752664092] [2020-02-10 20:45:16,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:16,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:16,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:16,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:16,777 INFO L87 Difference]: Start difference. First operand 807 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:45:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:16,923 INFO L93 Difference]: Finished difference Result 1502 states and 5173 transitions. [2020-02-10 20:45:16,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:16,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:16,927 INFO L225 Difference]: With dead ends: 1502 [2020-02-10 20:45:16,927 INFO L226 Difference]: Without dead ends: 1477 [2020-02-10 20:45:16,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:16,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2020-02-10 20:45:16,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 800. [2020-02-10 20:45:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:45:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3149 transitions. [2020-02-10 20:45:16,951 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3149 transitions. Word has length 25 [2020-02-10 20:45:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:16,952 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3149 transitions. [2020-02-10 20:45:16,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:16,952 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3149 transitions. [2020-02-10 20:45:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:16,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:16,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-02-10 20:45:16,953 INFO L427 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-02-10 20:45:16,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:16,953 INFO L82 PathProgramCache]: Analyzing trace with hash 553772057, now seen corresponding path program 473 times [2020-02-10 20:45:16,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:16,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70706441] [2020-02-10 20:45:16,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:17,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70706441] [2020-02-10 20:45:17,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:17,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:17,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543995043] [2020-02-10 20:45:17,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:17,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:17,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:17,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:17,371 INFO L87 Difference]: Start difference. First operand 800 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:45:17,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:17,518 INFO L93 Difference]: Finished difference Result 1496 states and 5161 transitions. [2020-02-10 20:45:17,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:17,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:17,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:17,522 INFO L225 Difference]: With dead ends: 1496 [2020-02-10 20:45:17,522 INFO L226 Difference]: Without dead ends: 1482 [2020-02-10 20:45:17,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:17,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2020-02-10 20:45:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 806. [2020-02-10 20:45:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-02-10 20:45:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3160 transitions. [2020-02-10 20:45:17,546 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3160 transitions. Word has length 25 [2020-02-10 20:45:17,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:17,546 INFO L479 AbstractCegarLoop]: Abstraction has 806 states and 3160 transitions. [2020-02-10 20:45:17,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3160 transitions. [2020-02-10 20:45:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:17,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:17,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-02-10 20:45:17,547 INFO L427 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-02-10 20:45:17,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:17,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2130254281, now seen corresponding path program 474 times [2020-02-10 20:45:17,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:17,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354490187] [2020-02-10 20:45:17,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:17,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354490187] [2020-02-10 20:45:17,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:17,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:17,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400789923] [2020-02-10 20:45:17,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:17,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:17,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:17,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:17,968 INFO L87 Difference]: Start difference. First operand 806 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:45:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:18,096 INFO L93 Difference]: Finished difference Result 1500 states and 5163 transitions. [2020-02-10 20:45:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:18,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:18,101 INFO L225 Difference]: With dead ends: 1500 [2020-02-10 20:45:18,101 INFO L226 Difference]: Without dead ends: 1470 [2020-02-10 20:45:18,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:18,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2020-02-10 20:45:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 794. [2020-02-10 20:45:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:45:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3132 transitions. [2020-02-10 20:45:18,128 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3132 transitions. Word has length 25 [2020-02-10 20:45:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:18,128 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3132 transitions. [2020-02-10 20:45:18,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3132 transitions. [2020-02-10 20:45:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:18,129 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:18,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-02-10 20:45:18,130 INFO L427 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-02-10 20:45:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1700807667, now seen corresponding path program 475 times [2020-02-10 20:45:18,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:18,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809438253] [2020-02-10 20:45:18,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:18,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809438253] [2020-02-10 20:45:18,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:18,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:18,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103906513] [2020-02-10 20:45:18,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:18,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:18,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:18,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:18,536 INFO L87 Difference]: Start difference. First operand 794 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:45:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:18,701 INFO L93 Difference]: Finished difference Result 1499 states and 5173 transitions. [2020-02-10 20:45:18,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:18,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:18,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:18,705 INFO L225 Difference]: With dead ends: 1499 [2020-02-10 20:45:18,705 INFO L226 Difference]: Without dead ends: 1483 [2020-02-10 20:45:18,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-02-10 20:45:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2020-02-10 20:45:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 806. [2020-02-10 20:45:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-02-10 20:45:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3165 transitions. [2020-02-10 20:45:18,729 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3165 transitions. Word has length 25 [2020-02-10 20:45:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:18,730 INFO L479 AbstractCegarLoop]: Abstraction has 806 states and 3165 transitions. [2020-02-10 20:45:18,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3165 transitions. [2020-02-10 20:45:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:18,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:18,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-02-10 20:45:18,731 INFO L427 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-02-10 20:45:18,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:18,731 INFO L82 PathProgramCache]: Analyzing trace with hash -983218671, now seen corresponding path program 476 times [2020-02-10 20:45:18,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:18,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414034647] [2020-02-10 20:45:18,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:19,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414034647] [2020-02-10 20:45:19,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:19,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:19,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381550218] [2020-02-10 20:45:19,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:19,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:19,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:19,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:19,159 INFO L87 Difference]: Start difference. First operand 806 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:45:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:19,352 INFO L93 Difference]: Finished difference Result 1497 states and 5164 transitions. [2020-02-10 20:45:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:19,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:19,357 INFO L225 Difference]: With dead ends: 1497 [2020-02-10 20:45:19,357 INFO L226 Difference]: Without dead ends: 1478 [2020-02-10 20:45:19,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-02-10 20:45:19,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-02-10 20:45:19,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 801. [2020-02-10 20:45:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:45:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3151 transitions. [2020-02-10 20:45:19,382 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3151 transitions. Word has length 25 [2020-02-10 20:45:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:19,382 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3151 transitions. [2020-02-10 20:45:19,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3151 transitions. [2020-02-10 20:45:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:19,383 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:19,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-02-10 20:45:19,383 INFO L427 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-02-10 20:45:19,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:19,383 INFO L82 PathProgramCache]: Analyzing trace with hash 100369813, now seen corresponding path program 477 times [2020-02-10 20:45:19,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:19,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443857174] [2020-02-10 20:45:19,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:19,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443857174] [2020-02-10 20:45:19,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:19,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:19,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777955920] [2020-02-10 20:45:19,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:19,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:19,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:19,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:19,798 INFO L87 Difference]: Start difference. First operand 801 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:45:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:19,991 INFO L93 Difference]: Finished difference Result 1507 states and 5184 transitions. [2020-02-10 20:45:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:19,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:19,996 INFO L225 Difference]: With dead ends: 1507 [2020-02-10 20:45:19,996 INFO L226 Difference]: Without dead ends: 1491 [2020-02-10 20:45:19,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:20,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2020-02-10 20:45:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 810. [2020-02-10 20:45:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-02-10 20:45:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3167 transitions. [2020-02-10 20:45:20,022 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3167 transitions. Word has length 25 [2020-02-10 20:45:20,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:20,022 INFO L479 AbstractCegarLoop]: Abstraction has 810 states and 3167 transitions. [2020-02-10 20:45:20,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3167 transitions. [2020-02-10 20:45:20,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:20,023 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:20,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-02-10 20:45:20,023 INFO L427 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-02-10 20:45:20,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:20,023 INFO L82 PathProgramCache]: Analyzing trace with hash -972715567, now seen corresponding path program 478 times [2020-02-10 20:45:20,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:20,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543518489] [2020-02-10 20:45:20,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:20,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543518489] [2020-02-10 20:45:20,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:20,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:20,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110781317] [2020-02-10 20:45:20,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:20,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:20,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:20,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:20,454 INFO L87 Difference]: Start difference. First operand 810 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:45:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:20,619 INFO L93 Difference]: Finished difference Result 1509 states and 5180 transitions. [2020-02-10 20:45:20,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:20,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:20,622 INFO L225 Difference]: With dead ends: 1509 [2020-02-10 20:45:20,623 INFO L226 Difference]: Without dead ends: 1482 [2020-02-10 20:45:20,623 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2020-02-10 20:45:20,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 801. [2020-02-10 20:45:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:45:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3144 transitions. [2020-02-10 20:45:20,646 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3144 transitions. Word has length 25 [2020-02-10 20:45:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:20,647 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3144 transitions. [2020-02-10 20:45:20,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3144 transitions. [2020-02-10 20:45:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:20,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:20,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-02-10 20:45:20,648 INFO L427 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-02-10 20:45:20,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash 110872917, now seen corresponding path program 479 times [2020-02-10 20:45:20,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:20,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255947432] [2020-02-10 20:45:20,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:21,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255947432] [2020-02-10 20:45:21,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:21,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:21,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472692563] [2020-02-10 20:45:21,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:21,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:21,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:21,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:21,084 INFO L87 Difference]: Start difference. First operand 801 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:45:21,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:21,301 INFO L93 Difference]: Finished difference Result 1500 states and 5162 transitions. [2020-02-10 20:45:21,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:21,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:21,305 INFO L225 Difference]: With dead ends: 1500 [2020-02-10 20:45:21,306 INFO L226 Difference]: Without dead ends: 1486 [2020-02-10 20:45:21,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-02-10 20:45:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2020-02-10 20:45:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 807. [2020-02-10 20:45:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:45:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3155 transitions. [2020-02-10 20:45:21,333 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3155 transitions. Word has length 25 [2020-02-10 20:45:21,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:21,333 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3155 transitions. [2020-02-10 20:45:21,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3155 transitions. [2020-02-10 20:45:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:21,334 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:21,334 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:21,334 INFO L427 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-02-10 20:45:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:21,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1721813875, now seen corresponding path program 480 times [2020-02-10 20:45:21,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:21,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015791876] [2020-02-10 20:45:21,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:21,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015791876] [2020-02-10 20:45:21,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:21,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:21,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233163191] [2020-02-10 20:45:21,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:21,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:21,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:21,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:21,758 INFO L87 Difference]: Start difference. First operand 807 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:45:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:21,890 INFO L93 Difference]: Finished difference Result 1504 states and 5164 transitions. [2020-02-10 20:45:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:21,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:21,894 INFO L225 Difference]: With dead ends: 1504 [2020-02-10 20:45:21,895 INFO L226 Difference]: Without dead ends: 1455 [2020-02-10 20:45:21,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-02-10 20:45:21,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-02-10 20:45:21,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 776. [2020-02-10 20:45:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:45:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-02-10 20:45:21,919 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-02-10 20:45:21,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:21,919 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-02-10 20:45:21,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-02-10 20:45:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:21,920 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:21,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-02-10 20:45:21,920 INFO L427 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-02-10 20:45:21,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:21,920 INFO L82 PathProgramCache]: Analyzing trace with hash -470807655, now seen corresponding path program 481 times [2020-02-10 20:45:21,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:21,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006699148] [2020-02-10 20:45:21,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:22,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006699148] [2020-02-10 20:45:22,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:22,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:22,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988609655] [2020-02-10 20:45:22,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:22,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:22,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:22,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:22,327 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:45:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:22,520 INFO L93 Difference]: Finished difference Result 1389 states and 4892 transitions. [2020-02-10 20:45:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:22,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:22,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:22,524 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 20:45:22,524 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:45:22,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:45:22,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 790. [2020-02-10 20:45:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:45:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3149 transitions. [2020-02-10 20:45:22,549 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3149 transitions. Word has length 25 [2020-02-10 20:45:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:22,549 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3149 transitions. [2020-02-10 20:45:22,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3149 transitions. [2020-02-10 20:45:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:22,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:22,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-02-10 20:45:22,550 INFO L427 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-02-10 20:45:22,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash 509947063, now seen corresponding path program 482 times [2020-02-10 20:45:22,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:22,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805138050] [2020-02-10 20:45:22,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:22,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805138050] [2020-02-10 20:45:22,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:22,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:22,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313245055] [2020-02-10 20:45:22,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:22,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:22,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:22,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:22,963 INFO L87 Difference]: Start difference. First operand 790 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:45:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:23,114 INFO L93 Difference]: Finished difference Result 1388 states and 4887 transitions. [2020-02-10 20:45:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:23,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:23,118 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 20:45:23,119 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 20:45:23,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-02-10 20:45:23,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 20:45:23,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-02-10 20:45:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:45:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-02-10 20:45:23,143 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-02-10 20:45:23,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:23,143 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-02-10 20:45:23,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-02-10 20:45:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:23,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:23,144 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:23,144 INFO L427 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-02-10 20:45:23,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:23,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1455226423, now seen corresponding path program 483 times [2020-02-10 20:45:23,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:23,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308768773] [2020-02-10 20:45:23,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:23,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308768773] [2020-02-10 20:45:23,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:23,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:23,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155569153] [2020-02-10 20:45:23,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:23,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:23,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:23,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:23,537 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:45:23,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:23,699 INFO L93 Difference]: Finished difference Result 1394 states and 4900 transitions. [2020-02-10 20:45:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:23,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:23,703 INFO L225 Difference]: With dead ends: 1394 [2020-02-10 20:45:23,704 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 20:45:23,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:23,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 20:45:23,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 791. [2020-02-10 20:45:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:45:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3148 transitions. [2020-02-10 20:45:23,728 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3148 transitions. Word has length 25 [2020-02-10 20:45:23,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:23,728 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3148 transitions. [2020-02-10 20:45:23,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3148 transitions. [2020-02-10 20:45:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:23,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:23,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-02-10 20:45:23,729 INFO L427 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-02-10 20:45:23,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:23,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1848483051, now seen corresponding path program 484 times [2020-02-10 20:45:23,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:23,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042877255] [2020-02-10 20:45:23,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:24,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042877255] [2020-02-10 20:45:24,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:24,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:24,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740695900] [2020-02-10 20:45:24,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:24,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:24,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:24,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:24,127 INFO L87 Difference]: Start difference. First operand 791 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:45:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:24,325 INFO L93 Difference]: Finished difference Result 1397 states and 4902 transitions. [2020-02-10 20:45:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:24,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:24,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:24,328 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 20:45:24,328 INFO L226 Difference]: Without dead ends: 1377 [2020-02-10 20:45:24,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-02-10 20:45:24,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 787. [2020-02-10 20:45:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:45:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-02-10 20:45:24,352 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-02-10 20:45:24,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:24,352 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-02-10 20:45:24,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-02-10 20:45:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:24,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:24,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-02-10 20:45:24,353 INFO L427 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-02-10 20:45:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:24,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1174168473, now seen corresponding path program 485 times [2020-02-10 20:45:24,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:24,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069555136] [2020-02-10 20:45:24,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:24,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069555136] [2020-02-10 20:45:24,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:24,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:24,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340055042] [2020-02-10 20:45:24,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:24,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:24,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:24,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:24,746 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:45:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:24,893 INFO L93 Difference]: Finished difference Result 1391 states and 4890 transitions. [2020-02-10 20:45:24,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:24,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:24,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:24,897 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 20:45:24,897 INFO L226 Difference]: Without dead ends: 1379 [2020-02-10 20:45:24,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-02-10 20:45:24,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-02-10 20:45:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 790. [2020-02-10 20:45:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:45:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3143 transitions. [2020-02-10 20:45:24,922 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3143 transitions. Word has length 25 [2020-02-10 20:45:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:24,922 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3143 transitions. [2020-02-10 20:45:24,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3143 transitions. [2020-02-10 20:45:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:24,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45: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-02-10 20:45:24,923 INFO L427 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-02-10 20:45:24,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:24,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1509857865, now seen corresponding path program 486 times [2020-02-10 20:45:24,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:24,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382231835] [2020-02-10 20:45:24,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:25,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382231835] [2020-02-10 20:45:25,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:25,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:25,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712605329] [2020-02-10 20:45:25,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:25,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:25,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:25,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:25,307 INFO L87 Difference]: Start difference. First operand 790 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:45:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:25,497 INFO L93 Difference]: Finished difference Result 1395 states and 4895 transitions. [2020-02-10 20:45:25,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:25,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:25,501 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:45:25,501 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 20:45:25,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:25,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 20:45:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 784. [2020-02-10 20:45:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:45:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3130 transitions. [2020-02-10 20:45:25,525 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3130 transitions. Word has length 25 [2020-02-10 20:45:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:25,525 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3130 transitions. [2020-02-10 20:45:25,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3130 transitions. [2020-02-10 20:45:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:25,526 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:25,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:25,526 INFO L427 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-02-10 20:45:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:25,526 INFO L82 PathProgramCache]: Analyzing trace with hash -893293381, now seen corresponding path program 487 times [2020-02-10 20:45:25,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:25,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707783359] [2020-02-10 20:45:25,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:25,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707783359] [2020-02-10 20:45:25,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:25,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:25,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324137848] [2020-02-10 20:45:25,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:25,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:25,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:25,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:25,935 INFO L87 Difference]: Start difference. First operand 784 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:45:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:26,129 INFO L93 Difference]: Finished difference Result 1387 states and 4885 transitions. [2020-02-10 20:45:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:26,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:26,133 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:45:26,133 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 20:45:26,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 20:45:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 790. [2020-02-10 20:45:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:45:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3146 transitions. [2020-02-10 20:45:26,157 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3146 transitions. Word has length 25 [2020-02-10 20:45:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:26,157 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3146 transitions. [2020-02-10 20:45:26,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3146 transitions. [2020-02-10 20:45:26,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:26,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:26,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-02-10 20:45:26,158 INFO L427 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-02-10 20:45:26,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:26,158 INFO L82 PathProgramCache]: Analyzing trace with hash 87461337, now seen corresponding path program 488 times [2020-02-10 20:45:26,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:26,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808909133] [2020-02-10 20:45:26,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:26,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808909133] [2020-02-10 20:45:26,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:26,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:26,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264239492] [2020-02-10 20:45:26,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:26,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:26,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:26,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:26,575 INFO L87 Difference]: Start difference. First operand 790 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:45:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:26,763 INFO L93 Difference]: Finished difference Result 1386 states and 4880 transitions. [2020-02-10 20:45:26,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:26,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:26,767 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 20:45:26,767 INFO L226 Difference]: Without dead ends: 1371 [2020-02-10 20:45:26,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-02-10 20:45:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-02-10 20:45:26,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 787. [2020-02-10 20:45:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:45:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-02-10 20:45:26,792 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-02-10 20:45:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:26,792 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-02-10 20:45:26,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-02-10 20:45:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:26,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:26,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-02-10 20:45:26,793 INFO L427 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-02-10 20:45:26,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:26,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1336192521, now seen corresponding path program 489 times [2020-02-10 20:45:26,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:26,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527677810] [2020-02-10 20:45:26,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:27,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527677810] [2020-02-10 20:45:27,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:27,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:27,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55638508] [2020-02-10 20:45:27,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:27,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:27,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:27,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:27,190 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:45:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:27,379 INFO L93 Difference]: Finished difference Result 1390 states and 4889 transitions. [2020-02-10 20:45:27,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:27,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:27,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:27,383 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:45:27,383 INFO L226 Difference]: Without dead ends: 1377 [2020-02-10 20:45:27,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-02-10 20:45:27,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 791. [2020-02-10 20:45:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:45:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-02-10 20:45:27,407 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-02-10 20:45:27,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:27,407 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-02-10 20:45:27,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-02-10 20:45:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:27,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:27,408 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:27,408 INFO L427 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-02-10 20:45:27,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:27,409 INFO L82 PathProgramCache]: Analyzing trace with hash -334431595, now seen corresponding path program 490 times [2020-02-10 20:45:27,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:27,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775305741] [2020-02-10 20:45:27,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45: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-02-10 20:45:27,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775305741] [2020-02-10 20:45:27,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:27,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:27,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491461838] [2020-02-10 20:45:27,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:27,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:27,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:27,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:27,808 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:45:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:27,967 INFO L93 Difference]: Finished difference Result 1391 states and 4887 transitions. [2020-02-10 20:45:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:27,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:27,971 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 20:45:27,972 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 20:45:27,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-02-10 20:45:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 20:45:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-02-10 20:45:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:45:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3135 transitions. [2020-02-10 20:45:27,996 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3135 transitions. Word has length 25 [2020-02-10 20:45:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:27,996 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3135 transitions. [2020-02-10 20:45:27,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3135 transitions. [2020-02-10 20:45:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:27,997 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:27,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-02-10 20:45:27,997 INFO L427 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-02-10 20:45:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:27,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1077278971, now seen corresponding path program 491 times [2020-02-10 20:45:27,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:27,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817000942] [2020-02-10 20:45:27,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:28,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817000942] [2020-02-10 20:45:28,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:28,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:28,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775587077] [2020-02-10 20:45:28,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:28,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:28,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:28,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:28,395 INFO L87 Difference]: Start difference. First operand 787 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:45:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:28,540 INFO L93 Difference]: Finished difference Result 1387 states and 4879 transitions. [2020-02-10 20:45:28,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:28,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:28,544 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:45:28,544 INFO L226 Difference]: Without dead ends: 1375 [2020-02-10 20:45:28,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-02-10 20:45:28,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-02-10 20:45:28,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 790. [2020-02-10 20:45:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:45:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-02-10 20:45:28,567 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-02-10 20:45:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:28,568 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-02-10 20:45:28,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-02-10 20:45:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:28,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:28,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:28,569 INFO L427 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-02-10 20:45:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:28,569 INFO L82 PathProgramCache]: Analyzing trace with hash 4193591, now seen corresponding path program 492 times [2020-02-10 20:45:28,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:28,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15556797] [2020-02-10 20:45:28,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:28,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15556797] [2020-02-10 20:45:28,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:28,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:28,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188309113] [2020-02-10 20:45:28,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:28,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:28,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:28,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:28,964 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:45:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:29,141 INFO L93 Difference]: Finished difference Result 1389 states and 4880 transitions. [2020-02-10 20:45:29,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:29,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:29,145 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 20:45:29,145 INFO L226 Difference]: Without dead ends: 1369 [2020-02-10 20:45:29,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-02-10 20:45:29,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2020-02-10 20:45:29,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 784. [2020-02-10 20:45:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:45:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-02-10 20:45:29,170 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-02-10 20:45:29,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:29,170 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-02-10 20:45:29,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-02-10 20:45:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:29,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:29,171 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:29,171 INFO L427 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-02-10 20:45:29,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:29,171 INFO L82 PathProgramCache]: Analyzing trace with hash 610254971, now seen corresponding path program 493 times [2020-02-10 20:45:29,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:29,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008437062] [2020-02-10 20:45:29,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:29,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008437062] [2020-02-10 20:45:29,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:29,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:29,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969858378] [2020-02-10 20:45:29,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:29,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:29,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:29,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:29,564 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:45:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:29,751 INFO L93 Difference]: Finished difference Result 1400 states and 4914 transitions. [2020-02-10 20:45:29,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:29,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:29,755 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 20:45:29,755 INFO L226 Difference]: Without dead ends: 1387 [2020-02-10 20:45: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-02-10 20:45:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-02-10 20:45:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 792. [2020-02-10 20:45:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:45:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 20:45:29,779 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 20:45:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:29,779 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 20:45:29,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 20:45:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:29,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:29,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-02-10 20:45:29,781 INFO L427 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-02-10 20:45:29,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:29,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1601512793, now seen corresponding path program 494 times [2020-02-10 20:45:29,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:29,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386439248] [2020-02-10 20:45:29,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:30,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386439248] [2020-02-10 20:45:30,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:30,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:30,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925355270] [2020-02-10 20:45:30,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:30,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:30,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:30,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:30,184 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:45:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:30,327 INFO L93 Difference]: Finished difference Result 1403 states and 4916 transitions. [2020-02-10 20:45:30,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:30,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:30,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:30,330 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:45:30,330 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:45:30,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-02-10 20:45:30,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:45:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-02-10 20:45:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:45:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 20:45:30,354 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 20:45:30,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:30,354 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 20:45:30,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:30,354 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 20:45:30,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:30,355 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:30,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-02-10 20:45:30,356 INFO L427 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-02-10 20:45:30,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:30,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1758678247, now seen corresponding path program 495 times [2020-02-10 20:45:30,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:30,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274014536] [2020-02-10 20:45:30,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:30,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274014536] [2020-02-10 20:45:30,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:30,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:30,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329480963] [2020-02-10 20:45:30,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:30,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:30,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:30,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:30,751 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:45:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:30,902 INFO L93 Difference]: Finished difference Result 1398 states and 4906 transitions. [2020-02-10 20:45:30,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:30,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:30,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:30,905 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 20:45:30,906 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:45:30,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:45:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 792. [2020-02-10 20:45:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:45:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 20:45:30,929 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 20:45:30,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:30,929 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 20:45:30,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 20:45:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:30,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:30,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:30,931 INFO L427 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-02-10 20:45:30,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:30,931 INFO L82 PathProgramCache]: Analyzing trace with hash -756917321, now seen corresponding path program 496 times [2020-02-10 20:45:30,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:30,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055890583] [2020-02-10 20:45:30,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:31,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055890583] [2020-02-10 20:45:31,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:31,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:31,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764789997] [2020-02-10 20:45:31,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:31,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:31,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:31,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:31,334 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:45:31,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:31,484 INFO L93 Difference]: Finished difference Result 1399 states and 4904 transitions. [2020-02-10 20:45:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:31,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:31,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:31,488 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 20:45:31,488 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 20:45:31,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 20:45:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 788. [2020-02-10 20:45:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:45:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-02-10 20:45:31,512 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-02-10 20:45:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:31,512 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-02-10 20:45:31,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-02-10 20:45:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:31,513 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:31,513 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:31,513 INFO L427 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-02-10 20:45:31,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:31,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1703636869, now seen corresponding path program 497 times [2020-02-10 20:45:31,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:31,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968469829] [2020-02-10 20:45:31,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:31,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968469829] [2020-02-10 20:45:31,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:31,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:31,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132445220] [2020-02-10 20:45:31,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:31,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:31,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:31,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:31,901 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:45:32,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:32,034 INFO L93 Difference]: Finished difference Result 1405 states and 4917 transitions. [2020-02-10 20:45:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:32,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:32,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:32,037 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 20:45:32,038 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:45:32,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:45:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 793. [2020-02-10 20:45:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:45:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3143 transitions. [2020-02-10 20:45:32,062 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3143 transitions. Word has length 25 [2020-02-10 20:45:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:32,062 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3143 transitions. [2020-02-10 20:45:32,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3143 transitions. [2020-02-10 20:45:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:32,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:32,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-02-10 20:45:32,063 INFO L427 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-02-10 20:45:32,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:32,063 INFO L82 PathProgramCache]: Analyzing trace with hash -92695911, now seen corresponding path program 498 times [2020-02-10 20:45:32,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:32,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593078724] [2020-02-10 20:45:32,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:32,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593078724] [2020-02-10 20:45:32,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:32,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:32,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53630207] [2020-02-10 20:45:32,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:32,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:32,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:32,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:32,456 INFO L87 Difference]: Start difference. First operand 793 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:45:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:32,594 INFO L93 Difference]: Finished difference Result 1403 states and 4908 transitions. [2020-02-10 20:45:32,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:32,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:32,598 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:45:32,598 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:45:32,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:45:32,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 784. [2020-02-10 20:45:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:45:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3124 transitions. [2020-02-10 20:45:32,621 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3124 transitions. Word has length 25 [2020-02-10 20:45:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:32,621 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3124 transitions. [2020-02-10 20:45:32,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3124 transitions. [2020-02-10 20:45:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:32,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:32,623 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:32,623 INFO L427 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-02-10 20:45:32,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:32,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1793744055, now seen corresponding path program 499 times [2020-02-10 20:45:32,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:32,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149258306] [2020-02-10 20:45:32,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:33,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-02-10 20:45:33,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149258306] [2020-02-10 20:45:33,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:33,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:33,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077880514] [2020-02-10 20:45:33,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:33,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:33,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:33,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:33,002 INFO L87 Difference]: Start difference. First operand 784 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:45:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:33,147 INFO L93 Difference]: Finished difference Result 1393 states and 4892 transitions. [2020-02-10 20:45:33,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:33,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:33,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:33,151 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 20:45:33,151 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 20:45:33,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-02-10 20:45:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 20:45:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 790. [2020-02-10 20:45:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:45:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-02-10 20:45:33,174 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-02-10 20:45:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:33,174 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-02-10 20:45:33,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-02-10 20:45:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:33,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:33,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:33,176 INFO L427 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-02-10 20:45:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:33,176 INFO L82 PathProgramCache]: Analyzing trace with hash -890282283, now seen corresponding path program 500 times [2020-02-10 20:45:33,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:33,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430212811] [2020-02-10 20:45:33,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:33,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430212811] [2020-02-10 20:45:33,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:33,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:33,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294801135] [2020-02-10 20:45:33,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:33,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:33,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:33,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:33,554 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:45:33,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:33,681 INFO L93 Difference]: Finished difference Result 1397 states and 4897 transitions. [2020-02-10 20:45:33,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:33,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:33,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:33,684 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 20:45:33,685 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 20:45:33,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 20:45:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 787. [2020-02-10 20:45:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:45:33,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3132 transitions. [2020-02-10 20:45:33,708 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3132 transitions. Word has length 25 [2020-02-10 20:45:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:33,708 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3132 transitions. [2020-02-10 20:45:33,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3132 transitions. [2020-02-10 20:45:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:33,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:33,709 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:33,709 INFO L427 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-02-10 20:45:33,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:33,710 INFO L82 PathProgramCache]: Analyzing trace with hash 193306201, now seen corresponding path program 501 times [2020-02-10 20:45:33,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:33,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726860818] [2020-02-10 20:45:33,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:34,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726860818] [2020-02-10 20:45:34,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:34,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:34,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76499049] [2020-02-10 20:45:34,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:34,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:34,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:34,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:34,122 INFO L87 Difference]: Start difference. First operand 787 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:45:34,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:34,272 INFO L93 Difference]: Finished difference Result 1391 states and 4885 transitions. [2020-02-10 20:45:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:34,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:34,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:34,276 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 20:45:34,276 INFO L226 Difference]: Without dead ends: 1379 [2020-02-10 20:45:34,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:34,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-02-10 20:45:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 790. [2020-02-10 20:45:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:45:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3137 transitions. [2020-02-10 20:45:34,300 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3137 transitions. Word has length 25 [2020-02-10 20:45:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:34,300 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3137 transitions. [2020-02-10 20:45:34,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3137 transitions. [2020-02-10 20:45:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:34,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:34,302 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:34,302 INFO L427 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-02-10 20:45:34,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:34,302 INFO L82 PathProgramCache]: Analyzing trace with hash -879779179, now seen corresponding path program 502 times [2020-02-10 20:45:34,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:34,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077611129] [2020-02-10 20:45:34,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:34,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077611129] [2020-02-10 20:45:34,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:34,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:34,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234558255] [2020-02-10 20:45:34,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:34,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:34,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:34,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:34,686 INFO L87 Difference]: Start difference. First operand 790 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:45:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:34,820 INFO L93 Difference]: Finished difference Result 1393 states and 4886 transitions. [2020-02-10 20:45:34,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:34,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:34,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:34,823 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 20:45:34,824 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:45:34,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-02-10 20:45:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:45:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 787. [2020-02-10 20:45:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:45:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3129 transitions. [2020-02-10 20:45:34,848 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3129 transitions. Word has length 25 [2020-02-10 20:45:34,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:34,848 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3129 transitions. [2020-02-10 20:45:34,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3129 transitions. [2020-02-10 20:45:34,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:34,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:34,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-02-10 20:45:34,849 INFO L427 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-02-10 20:45:34,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:34,849 INFO L82 PathProgramCache]: Analyzing trace with hash 203809305, now seen corresponding path program 503 times [2020-02-10 20:45:34,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:34,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697397875] [2020-02-10 20:45:34,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:35,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697397875] [2020-02-10 20:45:35,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:35,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:35,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122830603] [2020-02-10 20:45:35,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:35,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:35,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:35,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:35,235 INFO L87 Difference]: Start difference. First operand 787 states and 3129 transitions. Second operand 10 states. [2020-02-10 20:45:35,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:35,358 INFO L93 Difference]: Finished difference Result 1401 states and 4904 transitions. [2020-02-10 20:45:35,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:35,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:35,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:35,362 INFO L225 Difference]: With dead ends: 1401 [2020-02-10 20:45:35,363 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:45:35,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-02-10 20:45:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:45:35,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 792. [2020-02-10 20:45:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:45:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3138 transitions. [2020-02-10 20:45:35,387 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3138 transitions. Word has length 25 [2020-02-10 20:45:35,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:35,387 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3138 transitions. [2020-02-10 20:45:35,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:35,387 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3138 transitions. [2020-02-10 20:45:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:35,388 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:35,388 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:35,389 INFO L427 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-02-10 20:45:35,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:35,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1814750263, now seen corresponding path program 504 times [2020-02-10 20:45:35,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:35,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151565897] [2020-02-10 20:45:35,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:35,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151565897] [2020-02-10 20:45:35,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:35,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:35,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240393460] [2020-02-10 20:45:35,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:35,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:35,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:35,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:35,774 INFO L87 Difference]: Start difference. First operand 792 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:45:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:35,911 INFO L93 Difference]: Finished difference Result 1399 states and 4895 transitions. [2020-02-10 20:45:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:35,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:35,915 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 20:45:35,915 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 20:45:35,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:35,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 20:45:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 781. [2020-02-10 20:45:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:45:35,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 20:45:35,939 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 20:45:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:35,939 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 20:45:35,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 20:45:35,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:35,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:35,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:35,941 INFO L427 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-02-10 20:45:35,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:35,941 INFO L82 PathProgramCache]: Analyzing trace with hash -682963273, now seen corresponding path program 505 times [2020-02-10 20:45:35,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:35,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663594749] [2020-02-10 20:45:35,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:36,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663594749] [2020-02-10 20:45:36,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:36,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:36,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656361520] [2020-02-10 20:45:36,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:36,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:36,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:36,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:36,342 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:45:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:36,483 INFO L93 Difference]: Finished difference Result 1406 states and 4929 transitions. [2020-02-10 20:45:36,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:36,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:36,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:36,487 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 20:45:36,487 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:45:36,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:36,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:45:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 792. [2020-02-10 20:45:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:45:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3153 transitions. [2020-02-10 20:45:36,517 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3153 transitions. Word has length 25 [2020-02-10 20:45:36,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:36,517 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3153 transitions. [2020-02-10 20:45:36,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3153 transitions. [2020-02-10 20:45:36,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:36,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:36,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-02-10 20:45:36,518 INFO L427 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-02-10 20:45:36,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:36,519 INFO L82 PathProgramCache]: Analyzing trace with hash 297791445, now seen corresponding path program 506 times [2020-02-10 20:45:36,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:36,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017737989] [2020-02-10 20:45:36,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:36,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017737989] [2020-02-10 20:45:36,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:36,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:36,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144431873] [2020-02-10 20:45:36,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:36,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:36,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:36,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:36,931 INFO L87 Difference]: Start difference. First operand 792 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:45:37,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:37,065 INFO L93 Difference]: Finished difference Result 1405 states and 4924 transitions. [2020-02-10 20:45:37,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:37,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:37,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:37,069 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 20:45:37,069 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:45:37,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:37,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:45:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-02-10 20:45:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:45:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3145 transitions. [2020-02-10 20:45:37,094 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3145 transitions. Word has length 25 [2020-02-10 20:45:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:37,094 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3145 transitions. [2020-02-10 20:45:37,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3145 transitions. [2020-02-10 20:45:37,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:37,095 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:37,095 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:37,095 INFO L427 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-02-10 20:45:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:37,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1243070805, now seen corresponding path program 507 times [2020-02-10 20:45:37,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:37,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337504340] [2020-02-10 20:45:37,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:37,505 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-02-10 20:45:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:37,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337504340] [2020-02-10 20:45:37,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:37,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:37,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419450757] [2020-02-10 20:45:37,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:37,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:37,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:37,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:37,513 INFO L87 Difference]: Start difference. First operand 789 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:45:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:37,642 INFO L93 Difference]: Finished difference Result 1411 states and 4937 transitions. [2020-02-10 20:45:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:37,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:37,646 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:45:37,646 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:45:37,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:45:37,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 20:45:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:45:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-02-10 20:45:37,670 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-02-10 20:45:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:37,670 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-02-10 20:45:37,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-02-10 20:45:37,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:37,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:37,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-02-10 20:45:37,672 INFO L427 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-02-10 20:45:37,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:37,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2060638669, now seen corresponding path program 508 times [2020-02-10 20:45:37,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:37,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115644800] [2020-02-10 20:45:37,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:38,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115644800] [2020-02-10 20:45:38,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:38,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:38,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353865268] [2020-02-10 20:45:38,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:38,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:38,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:38,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:38,070 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:45:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:38,207 INFO L93 Difference]: Finished difference Result 1414 states and 4939 transitions. [2020-02-10 20:45:38,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:38,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:38,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:38,211 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:45:38,211 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:45:38,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:38,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:45:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 20:45:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:45:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3142 transitions. [2020-02-10 20:45:38,235 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3142 transitions. Word has length 25 [2020-02-10 20:45:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:38,235 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3142 transitions. [2020-02-10 20:45:38,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3142 transitions. [2020-02-10 20:45:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:38,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:38,236 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:38,237 INFO L427 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-02-10 20:45:38,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:38,237 INFO L82 PathProgramCache]: Analyzing trace with hash 962012855, now seen corresponding path program 509 times [2020-02-10 20:45:38,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:38,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521175494] [2020-02-10 20:45:38,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:38,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521175494] [2020-02-10 20:45:38,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:38,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:38,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52329114] [2020-02-10 20:45:38,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:38,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:38,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:38,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:38,635 INFO L87 Difference]: Start difference. First operand 789 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:45:38,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:38,765 INFO L93 Difference]: Finished difference Result 1408 states and 4927 transitions. [2020-02-10 20:45:38,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:38,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:38,770 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 20:45:38,770 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:45:38,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-02-10 20:45:38,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:45:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-02-10 20:45:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:45:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-02-10 20:45:38,794 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-02-10 20:45:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:38,794 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-02-10 20:45:38,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-02-10 20:45:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:38,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:38,796 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:38,796 INFO L427 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-02-10 20:45:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:38,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1722013483, now seen corresponding path program 510 times [2020-02-10 20:45:38,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:38,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103364281] [2020-02-10 20:45:38,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:39,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103364281] [2020-02-10 20:45:39,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:39,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:39,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989515504] [2020-02-10 20:45:39,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:39,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:39,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:39,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:39,188 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:45:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:39,335 INFO L93 Difference]: Finished difference Result 1412 states and 4932 transitions. [2020-02-10 20:45:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:39,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:39,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:39,338 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:45:39,339 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:45:39,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:45:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 786. [2020-02-10 20:45:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:45:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3134 transitions. [2020-02-10 20:45:39,362 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3134 transitions. Word has length 25 [2020-02-10 20:45:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:39,363 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3134 transitions. [2020-02-10 20:45:39,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3134 transitions. [2020-02-10 20:45:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:39,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45: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-02-10 20:45:39,364 INFO L427 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-02-10 20:45:39,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:39,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1527934725, now seen corresponding path program 511 times [2020-02-10 20:45:39,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:39,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215102068] [2020-02-10 20:45:39,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:39,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215102068] [2020-02-10 20:45:39,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:39,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:39,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35908031] [2020-02-10 20:45:39,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:39,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:39,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:39,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:39,777 INFO L87 Difference]: Start difference. First operand 786 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:45:39,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:39,910 INFO L93 Difference]: Finished difference Result 1411 states and 4936 transitions. [2020-02-10 20:45:39,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:39,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:39,915 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:45:39,915 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:45:39,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:39,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:45:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 20:45:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:45:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3153 transitions. [2020-02-10 20:45:39,939 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3153 transitions. Word has length 25 [2020-02-10 20:45:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:39,940 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3153 transitions. [2020-02-10 20:45:39,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3153 transitions. [2020-02-10 20:45:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:39,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:39,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:39,941 INFO L427 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-02-10 20:45:39,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:39,941 INFO L82 PathProgramCache]: Analyzing trace with hash -547180007, now seen corresponding path program 512 times [2020-02-10 20:45:39,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:39,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596103784] [2020-02-10 20:45:39,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:40,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596103784] [2020-02-10 20:45:40,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:40,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:40,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980032580] [2020-02-10 20:45:40,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:40,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:40,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:40,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:40,351 INFO L87 Difference]: Start difference. First operand 793 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:45:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:40,486 INFO L93 Difference]: Finished difference Result 1410 states and 4931 transitions. [2020-02-10 20:45:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:40,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:40,490 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 20:45:40,490 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 20:45:40,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 20:45:40,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 790. [2020-02-10 20:45:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:45:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3145 transitions. [2020-02-10 20:45:40,514 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3145 transitions. Word has length 25 [2020-02-10 20:45:40,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:40,514 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3145 transitions. [2020-02-10 20:45:40,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3145 transitions. [2020-02-10 20:45:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:40,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:40,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-02-10 20:45:40,515 INFO L427 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-02-10 20:45:40,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:40,515 INFO L82 PathProgramCache]: Analyzing trace with hash -44799787, now seen corresponding path program 513 times [2020-02-10 20:45:40,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:40,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603294495] [2020-02-10 20:45:40,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:40,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603294495] [2020-02-10 20:45:40,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:40,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:40,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996284435] [2020-02-10 20:45:40,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:40,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:40,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:40,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:40,913 INFO L87 Difference]: Start difference. First operand 790 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:45:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:41,061 INFO L93 Difference]: Finished difference Result 1419 states and 4949 transitions. [2020-02-10 20:45:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:41,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:41,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:41,065 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:45:41,065 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:45:41,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:45:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 795. [2020-02-10 20:45:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:45:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3154 transitions. [2020-02-10 20:45:41,088 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3154 transitions. Word has length 25 [2020-02-10 20:45:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:41,088 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3154 transitions. [2020-02-10 20:45:41,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3154 transitions. [2020-02-10 20:45:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:41,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:41,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-02-10 20:45:41,089 INFO L427 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-02-10 20:45:41,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:41,090 INFO L82 PathProgramCache]: Analyzing trace with hash 967464243, now seen corresponding path program 514 times [2020-02-10 20:45:41,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:41,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262456950] [2020-02-10 20:45:41,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:41,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262456950] [2020-02-10 20:45:41,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:41,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:41,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657451345] [2020-02-10 20:45:41,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:41,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:41,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:41,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:41,510 INFO L87 Difference]: Start difference. First operand 795 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:45:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:41,617 INFO L93 Difference]: Finished difference Result 1424 states and 4954 transitions. [2020-02-10 20:45:41,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:41,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:41,620 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 20:45:41,621 INFO L226 Difference]: Without dead ends: 1401 [2020-02-10 20:45:41,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-02-10 20:45:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-02-10 20:45:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 790. [2020-02-10 20:45:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:45:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3141 transitions. [2020-02-10 20:45:41,645 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3141 transitions. Word has length 25 [2020-02-10 20:45:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:41,645 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3141 transitions. [2020-02-10 20:45:41,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3141 transitions. [2020-02-10 20:45:41,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:41,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:41,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-02-10 20:45:41,646 INFO L427 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-02-10 20:45:41,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:41,647 INFO L82 PathProgramCache]: Analyzing trace with hash 768233851, now seen corresponding path program 515 times [2020-02-10 20:45:41,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:41,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710908244] [2020-02-10 20:45:41,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:42,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710908244] [2020-02-10 20:45:42,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:42,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:42,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364554278] [2020-02-10 20:45:42,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:42,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:42,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:42,031 INFO L87 Difference]: Start difference. First operand 790 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:45:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:42,161 INFO L93 Difference]: Finished difference Result 1416 states and 4938 transitions. [2020-02-10 20:45:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:42,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:42,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:42,165 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:45:42,165 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 20:45:42,165 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 20:45:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 794. [2020-02-10 20:45:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:45:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3148 transitions. [2020-02-10 20:45:42,189 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3148 transitions. Word has length 25 [2020-02-10 20:45:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:42,190 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3148 transitions. [2020-02-10 20:45:42,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3148 transitions. [2020-02-10 20:45:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:42,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:42,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-02-10 20:45:42,191 INFO L427 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-02-10 20:45:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:42,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1306089429, now seen corresponding path program 516 times [2020-02-10 20:45:42,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:42,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896295301] [2020-02-10 20:45:42,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:42,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896295301] [2020-02-10 20:45:42,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:42,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:42,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70208253] [2020-02-10 20:45:42,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:42,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:42,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:42,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:42,594 INFO L87 Difference]: Start difference. First operand 794 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:45:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:42,697 INFO L93 Difference]: Finished difference Result 1422 states and 4946 transitions. [2020-02-10 20:45:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:42,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:42,701 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:45:42,701 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:45:42,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-02-10 20:45:42,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:45:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 786. [2020-02-10 20:45:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:45:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3130 transitions. [2020-02-10 20:45:42,725 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3130 transitions. Word has length 25 [2020-02-10 20:45:42,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:42,725 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3130 transitions. [2020-02-10 20:45:42,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3130 transitions. [2020-02-10 20:45:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:42,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:42,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-02-10 20:45:42,727 INFO L427 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-02-10 20:45:42,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:42,727 INFO L82 PathProgramCache]: Analyzing trace with hash -24386373, now seen corresponding path program 517 times [2020-02-10 20:45:42,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:42,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699616864] [2020-02-10 20:45:42,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:43,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:43,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699616864] [2020-02-10 20:45:43,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:43,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:43,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506142101] [2020-02-10 20:45:43,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:43,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:43,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:43,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:43,125 INFO L87 Difference]: Start difference. First operand 786 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:45:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:43,255 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-02-10 20:45:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:43,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:43,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:43,259 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:45:43,260 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 20:45:43,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:43,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 20:45:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 796. [2020-02-10 20:45:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:45:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3157 transitions. [2020-02-10 20:45:43,283 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3157 transitions. Word has length 25 [2020-02-10 20:45:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:43,283 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3157 transitions. [2020-02-10 20:45:43,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3157 transitions. [2020-02-10 20:45:43,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:43,285 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:43,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-02-10 20:45:43,285 INFO L427 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-02-10 20:45:43,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:43,285 INFO L82 PathProgramCache]: Analyzing trace with hash 966871449, now seen corresponding path program 518 times [2020-02-10 20:45:43,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:43,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952066329] [2020-02-10 20:45:43,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:43,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952066329] [2020-02-10 20:45:43,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:43,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:43,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060775115] [2020-02-10 20:45:43,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:43,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:43,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:43,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:43,690 INFO L87 Difference]: Start difference. First operand 796 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:45:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:43,822 INFO L93 Difference]: Finished difference Result 1431 states and 4975 transitions. [2020-02-10 20:45:43,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:43,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:43,826 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 20:45:43,827 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 20:45:43,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-02-10 20:45:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 20:45:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 792. [2020-02-10 20:45:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:45:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3146 transitions. [2020-02-10 20:45:43,851 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3146 transitions. Word has length 25 [2020-02-10 20:45:43,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:43,851 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3146 transitions. [2020-02-10 20:45:43,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3146 transitions. [2020-02-10 20:45:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:43,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:43,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-02-10 20:45:43,852 INFO L427 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-02-10 20:45:43,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:43,852 INFO L82 PathProgramCache]: Analyzing trace with hash -467285513, now seen corresponding path program 519 times [2020-02-10 20:45:43,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:43,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841067925] [2020-02-10 20:45:43,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:44,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841067925] [2020-02-10 20:45:44,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:44,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:44,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377139431] [2020-02-10 20:45:44,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:44,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:44,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:44,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:44,258 INFO L87 Difference]: Start difference. First operand 792 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:45:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:44,398 INFO L93 Difference]: Finished difference Result 1431 states and 4974 transitions. [2020-02-10 20:45:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:44,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:44,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:44,401 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 20:45:44,402 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:45:44,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-02-10 20:45:44,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:45:44,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 797. [2020-02-10 20:45:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:45:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3155 transitions. [2020-02-10 20:45:44,425 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3155 transitions. Word has length 25 [2020-02-10 20:45:44,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:44,425 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3155 transitions. [2020-02-10 20:45:44,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3155 transitions. [2020-02-10 20:45:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:44,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:44,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-02-10 20:45:44,427 INFO L427 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-02-10 20:45:44,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:44,427 INFO L82 PathProgramCache]: Analyzing trace with hash 544978517, now seen corresponding path program 520 times [2020-02-10 20:45:44,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:44,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533149611] [2020-02-10 20:45:44,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:44,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533149611] [2020-02-10 20:45:44,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:44,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:44,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638182139] [2020-02-10 20:45:44,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:44,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:44,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:44,845 INFO L87 Difference]: Start difference. First operand 797 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:45:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:44,963 INFO L93 Difference]: Finished difference Result 1436 states and 4979 transitions. [2020-02-10 20:45:44,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:44,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:44,967 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 20:45:44,967 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 20:45:44,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 20:45:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 792. [2020-02-10 20:45:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:45:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-02-10 20:45:45,008 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-02-10 20:45:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:45,009 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-02-10 20:45:45,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-02-10 20:45:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:45,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:45,010 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:45,010 INFO L427 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-02-10 20:45:45,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:45,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2012681989, now seen corresponding path program 521 times [2020-02-10 20:45:45,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:45,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997329654] [2020-02-10 20:45:45,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:45,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997329654] [2020-02-10 20:45:45,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:45,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:45,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727205665] [2020-02-10 20:45:45,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:45,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:45,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:45,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:45,427 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:45:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:45,567 INFO L93 Difference]: Finished difference Result 1441 states and 4991 transitions. [2020-02-10 20:45:45,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:45,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:45,571 INFO L225 Difference]: With dead ends: 1441 [2020-02-10 20:45:45,572 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 20:45:45,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 20:45:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 801. [2020-02-10 20:45:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:45:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3157 transitions. [2020-02-10 20:45:45,596 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3157 transitions. Word has length 25 [2020-02-10 20:45:45,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:45,596 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3157 transitions. [2020-02-10 20:45:45,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3157 transitions. [2020-02-10 20:45:45,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:45,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:45,597 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:45,597 INFO L427 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-02-10 20:45:45,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:45,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1209199927, now seen corresponding path program 522 times [2020-02-10 20:45:45,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:45,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926166710] [2020-02-10 20:45:45,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:46,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926166710] [2020-02-10 20:45:46,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:46,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:46,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610163124] [2020-02-10 20:45:46,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:46,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:46,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:46,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:46,021 INFO L87 Difference]: Start difference. First operand 801 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:45:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:46,139 INFO L93 Difference]: Finished difference Result 1443 states and 4987 transitions. [2020-02-10 20:45:46,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:46,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:46,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:46,142 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 20:45:46,142 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:45:46,143 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:46,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:45:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 786. [2020-02-10 20:45:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:45:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3125 transitions. [2020-02-10 20:45:46,166 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3125 transitions. Word has length 25 [2020-02-10 20:45:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:46,166 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3125 transitions. [2020-02-10 20:45:46,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3125 transitions. [2020-02-10 20:45:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:46,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:46,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:46,167 INFO L427 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-02-10 20:45:46,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:46,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1209830507, now seen corresponding path program 523 times [2020-02-10 20:45:46,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:46,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142817431] [2020-02-10 20:45:46,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:46,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142817431] [2020-02-10 20:45:46,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:46,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:46,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558717154] [2020-02-10 20:45:46,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:46,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:46,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:46,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:46,561 INFO L87 Difference]: Start difference. First operand 786 states and 3125 transitions. Second operand 10 states. [2020-02-10 20:45:46,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:46,700 INFO L93 Difference]: Finished difference Result 1421 states and 4949 transitions. [2020-02-10 20:45:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:46,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:46,704 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:45:46,704 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 20:45:46,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:46,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 20:45:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 794. [2020-02-10 20:45:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:45:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-02-10 20:45:46,728 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-02-10 20:45:46,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:46,728 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-02-10 20:45:46,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-02-10 20:45:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:46,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:46,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-02-10 20:45:46,729 INFO L427 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-02-10 20:45:46,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:46,730 INFO L82 PathProgramCache]: Analyzing trace with hash 401110451, now seen corresponding path program 524 times [2020-02-10 20:45:46,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:46,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973378933] [2020-02-10 20:45:46,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:47,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973378933] [2020-02-10 20:45:47,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:47,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:47,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204937482] [2020-02-10 20:45:47,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:47,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:47,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:47,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:47,130 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:45:47,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:47,248 INFO L93 Difference]: Finished difference Result 1425 states and 4954 transitions. [2020-02-10 20:45:47,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:47,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:47,252 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 20:45:47,252 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:45:47,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:47,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:45:47,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 791. [2020-02-10 20:45:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:45:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3138 transitions. [2020-02-10 20:45:47,276 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3138 transitions. Word has length 25 [2020-02-10 20:45:47,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:47,276 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3138 transitions. [2020-02-10 20:45:47,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3138 transitions. [2020-02-10 20:45:47,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:47,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:47,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-02-10 20:45:47,277 INFO L427 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-02-10 20:45:47,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:47,277 INFO L82 PathProgramCache]: Analyzing trace with hash -115738919, now seen corresponding path program 525 times [2020-02-10 20:45:47,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:47,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627157634] [2020-02-10 20:45:47,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:47,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627157634] [2020-02-10 20:45:47,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:47,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:47,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074222050] [2020-02-10 20:45:47,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:47,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:47,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:47,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:47,674 INFO L87 Difference]: Start difference. First operand 791 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:45:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:47,811 INFO L93 Difference]: Finished difference Result 1424 states and 4951 transitions. [2020-02-10 20:45:47,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:47,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:47,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:47,815 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 20:45:47,815 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:45:47,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:45:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-02-10 20:45:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:45:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-02-10 20:45:47,839 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-02-10 20:45:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:47,839 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-02-10 20:45:47,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:47,839 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-02-10 20:45:47,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:47,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:47,840 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:47,840 INFO L427 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-02-10 20:45:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash 422116659, now seen corresponding path program 526 times [2020-02-10 20:45:47,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:47,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385472690] [2020-02-10 20:45:47,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:48,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385472690] [2020-02-10 20:45:48,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:48,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:48,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726870949] [2020-02-10 20:45:48,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:48,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:48,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:48,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:48,235 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:45:48,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:48,340 INFO L93 Difference]: Finished difference Result 1430 states and 4959 transitions. [2020-02-10 20:45:48,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:48,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:48,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:48,344 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 20:45:48,344 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 20:45:48,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-02-10 20:45:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 20:45:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 791. [2020-02-10 20:45:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:45:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3134 transitions. [2020-02-10 20:45:48,368 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3134 transitions. Word has length 25 [2020-02-10 20:45:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:48,368 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3134 transitions. [2020-02-10 20:45:48,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3134 transitions. [2020-02-10 20:45:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:48,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:48,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-02-10 20:45:48,370 INFO L427 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-02-10 20:45:48,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:48,370 INFO L82 PathProgramCache]: Analyzing trace with hash -105235815, now seen corresponding path program 527 times [2020-02-10 20:45:48,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:48,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988762066] [2020-02-10 20:45:48,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:48,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988762066] [2020-02-10 20:45:48,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:48,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:48,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171231770] [2020-02-10 20:45:48,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:48,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:48,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:48,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:48,775 INFO L87 Difference]: Start difference. First operand 791 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:45:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:48,923 INFO L93 Difference]: Finished difference Result 1437 states and 4976 transitions. [2020-02-10 20:45:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:48,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:48,927 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 20:45:48,927 INFO L226 Difference]: Without dead ends: 1421 [2020-02-10 20:45:48,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-02-10 20:45:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 800. [2020-02-10 20:45:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:45:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3150 transitions. [2020-02-10 20:45:48,951 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3150 transitions. Word has length 25 [2020-02-10 20:45:48,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:48,951 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3150 transitions. [2020-02-10 20:45:48,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3150 transitions. [2020-02-10 20:45:48,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:48,952 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:48,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-02-10 20:45:48,952 INFO L427 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-02-10 20:45:48,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:48,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1178321195, now seen corresponding path program 528 times [2020-02-10 20:45:48,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:48,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544264683] [2020-02-10 20:45:48,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:49,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544264683] [2020-02-10 20:45:49,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:49,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:49,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199153655] [2020-02-10 20:45:49,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:49,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:49,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:49,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:49,363 INFO L87 Difference]: Start difference. First operand 800 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:45:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:49,517 INFO L93 Difference]: Finished difference Result 1439 states and 4972 transitions. [2020-02-10 20:45:49,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:49,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:49,520 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 20:45:49,521 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:45:49,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:45:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 781. [2020-02-10 20:45:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:45:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3111 transitions. [2020-02-10 20:45:49,545 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3111 transitions. Word has length 25 [2020-02-10 20:45:49,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:49,545 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3111 transitions. [2020-02-10 20:45:49,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3111 transitions. [2020-02-10 20:45:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:49,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:49,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-02-10 20:45:49,547 INFO L427 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-02-10 20:45:49,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:49,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1317604617, now seen corresponding path program 529 times [2020-02-10 20:45:49,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:49,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879817959] [2020-02-10 20:45:49,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:49,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-02-10 20:45:49,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879817959] [2020-02-10 20:45:49,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:49,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:49,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928728612] [2020-02-10 20:45:49,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:49,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:49,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:49,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:49,954 INFO L87 Difference]: Start difference. First operand 781 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:45:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:50,098 INFO L93 Difference]: Finished difference Result 1396 states and 4902 transitions. [2020-02-10 20:45:50,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:50,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:50,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:50,102 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 20:45:50,102 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:45:50,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-02-10 20:45:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:45:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 791. [2020-02-10 20:45:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:45:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-02-10 20:45:50,128 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-02-10 20:45:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:50,128 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-02-10 20:45:50,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-02-10 20:45:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:50,129 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:50,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-02-10 20:45:50,129 INFO L427 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-02-10 20:45:50,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:50,129 INFO L82 PathProgramCache]: Analyzing trace with hash -336849899, now seen corresponding path program 530 times [2020-02-10 20:45:50,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:50,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047689852] [2020-02-10 20:45:50,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:50,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047689852] [2020-02-10 20:45:50,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:50,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:50,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618729282] [2020-02-10 20:45:50,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:50,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:50,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:50,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:50,543 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:45:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:50,689 INFO L93 Difference]: Finished difference Result 1395 states and 4897 transitions. [2020-02-10 20:45:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:50,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:50,693 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:45:50,693 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:45:50,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:45:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 788. [2020-02-10 20:45:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:45:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3137 transitions. [2020-02-10 20:45:50,719 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3137 transitions. Word has length 25 [2020-02-10 20:45:50,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:50,719 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3137 transitions. [2020-02-10 20:45:50,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3137 transitions. [2020-02-10 20:45:50,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:50,720 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:50,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-02-10 20:45:50,720 INFO L427 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-02-10 20:45:50,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:50,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1760503757, now seen corresponding path program 531 times [2020-02-10 20:45:50,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:50,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434406353] [2020-02-10 20:45:50,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:51,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434406353] [2020-02-10 20:45:51,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:51,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:51,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983456995] [2020-02-10 20:45:51,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:51,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:51,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:51,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:51,127 INFO L87 Difference]: Start difference. First operand 788 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:45:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:51,270 INFO L93 Difference]: Finished difference Result 1399 states and 4906 transitions. [2020-02-10 20:45:51,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:51,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:51,274 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 20:45:51,274 INFO L226 Difference]: Without dead ends: 1386 [2020-02-10 20:45:51,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-02-10 20:45:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 792. [2020-02-10 20:45:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:45:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3144 transitions. [2020-02-10 20:45:51,299 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3144 transitions. Word has length 25 [2020-02-10 20:45:51,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:51,299 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3144 transitions. [2020-02-10 20:45:51,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3144 transitions. [2020-02-10 20:45:51,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:51,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:51,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-02-10 20:45:51,300 INFO L427 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-02-10 20:45:51,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:51,300 INFO L82 PathProgramCache]: Analyzing trace with hash -758742831, now seen corresponding path program 532 times [2020-02-10 20:45:51,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:51,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130085642] [2020-02-10 20:45:51,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:51,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130085642] [2020-02-10 20:45:51,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:51,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:51,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686693349] [2020-02-10 20:45:51,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:51,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:51,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:51,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:51,705 INFO L87 Difference]: Start difference. First operand 792 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:45:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:51,845 INFO L93 Difference]: Finished difference Result 1400 states and 4904 transitions. [2020-02-10 20:45:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:51,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:51,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:51,850 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 20:45:51,850 INFO L226 Difference]: Without dead ends: 1382 [2020-02-10 20:45:51,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-02-10 20:45:51,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-02-10 20:45:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 788. [2020-02-10 20:45:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:45:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-02-10 20:45:51,876 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-02-10 20:45:51,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:51,876 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-02-10 20:45:51,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:51,876 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-02-10 20:45:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:51,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:51,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:51,877 INFO L427 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-02-10 20:45:51,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:51,877 INFO L82 PathProgramCache]: Analyzing trace with hash 652967735, now seen corresponding path program 533 times [2020-02-10 20:45:51,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:51,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707617109] [2020-02-10 20:45:51,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:52,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707617109] [2020-02-10 20:45:52,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:52,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:52,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604071741] [2020-02-10 20:45:52,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:52,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:52,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:52,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:52,284 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:45:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:52,417 INFO L93 Difference]: Finished difference Result 1396 states and 4896 transitions. [2020-02-10 20:45:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:52,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:52,421 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 20:45:52,422 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 20:45:52,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-02-10 20:45:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 20:45:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 791. [2020-02-10 20:45:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:45:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3139 transitions. [2020-02-10 20:45:52,446 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3139 transitions. Word has length 25 [2020-02-10 20:45:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:52,446 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3139 transitions. [2020-02-10 20:45:52,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3139 transitions. [2020-02-10 20:45:52,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:52,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:52,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-02-10 20:45:52,447 INFO L427 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-02-10 20:45:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:52,447 INFO L82 PathProgramCache]: Analyzing trace with hash -420117645, now seen corresponding path program 534 times [2020-02-10 20:45:52,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:52,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796047116] [2020-02-10 20:45:52,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:52,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796047116] [2020-02-10 20:45:52,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:52,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:52,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235936449] [2020-02-10 20:45:52,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:52,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:52,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:52,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:52,871 INFO L87 Difference]: Start difference. First operand 791 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:45:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:53,009 INFO L93 Difference]: Finished difference Result 1398 states and 4897 transitions. [2020-02-10 20:45:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:53,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:53,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:53,013 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 20:45:53,013 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 20:45:53,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 20:45:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 785. [2020-02-10 20:45:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:45:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3126 transitions. [2020-02-10 20:45:53,037 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3126 transitions. Word has length 25 [2020-02-10 20:45:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:53,038 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3126 transitions. [2020-02-10 20:45:53,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3126 transitions. [2020-02-10 20:45:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:53,039 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:53,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-02-10 20:45:53,039 INFO L427 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-02-10 20:45:53,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:53,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1740090343, now seen corresponding path program 535 times [2020-02-10 20:45:53,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:53,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968535263] [2020-02-10 20:45:53,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:53,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968535263] [2020-02-10 20:45:53,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:53,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:53,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049311818] [2020-02-10 20:45:53,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:53,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:53,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:53,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:53,448 INFO L87 Difference]: Start difference. First operand 785 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:45:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:53,583 INFO L93 Difference]: Finished difference Result 1403 states and 4913 transitions. [2020-02-10 20:45:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:53,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:53,588 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:45:53,588 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:45:53,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:45:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 792. [2020-02-10 20:45:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:45:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 20:45:53,612 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 20:45:53,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:53,612 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 20:45:53,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:53,612 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 20:45:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:53,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:53,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-02-10 20:45:53,613 INFO L427 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-02-10 20:45:53,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:53,613 INFO L82 PathProgramCache]: Analyzing trace with hash -759335625, now seen corresponding path program 536 times [2020-02-10 20:45:53,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:53,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156530432] [2020-02-10 20:45:53,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:54,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156530432] [2020-02-10 20:45:54,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:54,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:54,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067255436] [2020-02-10 20:45:54,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:54,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:54,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:54,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:54,050 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:45:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:54,207 INFO L93 Difference]: Finished difference Result 1402 states and 4908 transitions. [2020-02-10 20:45:54,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:54,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:54,211 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 20:45:54,211 INFO L226 Difference]: Without dead ends: 1387 [2020-02-10 20:45:54,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:54,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-02-10 20:45:54,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 789. [2020-02-10 20:45:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:45:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3137 transitions. [2020-02-10 20:45:54,236 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3137 transitions. Word has length 25 [2020-02-10 20:45:54,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:54,236 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3137 transitions. [2020-02-10 20:45:54,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3137 transitions. [2020-02-10 20:45:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:54,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:54,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-02-10 20:45:54,238 INFO L427 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-02-10 20:45:54,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:54,238 INFO L82 PathProgramCache]: Analyzing trace with hash -256955405, now seen corresponding path program 537 times [2020-02-10 20:45:54,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:54,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518771377] [2020-02-10 20:45:54,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:54,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-02-10 20:45:54,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518771377] [2020-02-10 20:45:54,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:54,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:54,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078485157] [2020-02-10 20:45:54,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:54,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:54,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:54,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:54,631 INFO L87 Difference]: Start difference. First operand 789 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:45:54,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:54,790 INFO L93 Difference]: Finished difference Result 1411 states and 4926 transitions. [2020-02-10 20:45:54,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:54,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:54,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:54,794 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:45:54,794 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:45:54,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:54,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:45:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-02-10 20:45:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:45:54,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-02-10 20:45:54,819 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-02-10 20:45:54,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:54,819 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-02-10 20:45:54,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-02-10 20:45:54,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:54,820 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:54,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-02-10 20:45:54,821 INFO L427 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-02-10 20:45:54,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:54,821 INFO L82 PathProgramCache]: Analyzing trace with hash 755308625, now seen corresponding path program 538 times [2020-02-10 20:45:54,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:54,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462733809] [2020-02-10 20:45:54,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:55,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462733809] [2020-02-10 20:45:55,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:55,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:55,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214159849] [2020-02-10 20:45:55,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:55,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:55,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:55,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:55,226 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:45:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:55,344 INFO L93 Difference]: Finished difference Result 1416 states and 4931 transitions. [2020-02-10 20:45:55,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:55,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:55,348 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:45:55,348 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:45:55,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-02-10 20:45:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:45:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-02-10 20:45:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:45:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3133 transitions. [2020-02-10 20:45:55,373 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3133 transitions. Word has length 25 [2020-02-10 20:45:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:55,373 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3133 transitions. [2020-02-10 20:45:55,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3133 transitions. [2020-02-10 20:45:55,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:55,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:55,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-02-10 20:45:55,374 INFO L427 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-02-10 20:45:55,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:55,374 INFO L82 PathProgramCache]: Analyzing trace with hash 556078233, now seen corresponding path program 539 times [2020-02-10 20:45:55,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:55,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481111387] [2020-02-10 20:45:55,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:55,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481111387] [2020-02-10 20:45:55,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:55,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:55,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104849711] [2020-02-10 20:45:55,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:55,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:55,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:55,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:55,767 INFO L87 Difference]: Start difference. First operand 789 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:45:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:55,914 INFO L93 Difference]: Finished difference Result 1408 states and 4915 transitions. [2020-02-10 20:45:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:55,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:55,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:55,918 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 20:45:55,919 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:45:55,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-02-10 20:45:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:45:55,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 793. [2020-02-10 20:45:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:45:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3140 transitions. [2020-02-10 20:45:55,943 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3140 transitions. Word has length 25 [2020-02-10 20:45:55,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:55,943 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3140 transitions. [2020-02-10 20:45:55,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:55,943 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3140 transitions. [2020-02-10 20:45:55,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:55,944 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:55,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:55,945 INFO L427 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-02-10 20:45:55,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:55,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1093933811, now seen corresponding path program 540 times [2020-02-10 20:45:55,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:55,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696709685] [2020-02-10 20:45:55,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:56,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696709685] [2020-02-10 20:45:56,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:56,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:56,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500082965] [2020-02-10 20:45:56,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:56,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:56,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:56,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:56,361 INFO L87 Difference]: Start difference. First operand 793 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:45:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:56,512 INFO L93 Difference]: Finished difference Result 1414 states and 4923 transitions. [2020-02-10 20:45:56,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:56,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:56,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:56,516 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:45:56,516 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:45:56,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-02-10 20:45:56,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:45:56,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 785. [2020-02-10 20:45:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:45:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3122 transitions. [2020-02-10 20:45:56,541 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3122 transitions. Word has length 25 [2020-02-10 20:45:56,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:56,541 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3122 transitions. [2020-02-10 20:45:56,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3122 transitions. [2020-02-10 20:45:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:56,543 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:56,543 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:45:56,543 INFO L427 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-02-10 20:45:56,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:56,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1267006361, now seen corresponding path program 541 times [2020-02-10 20:45:56,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:56,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305290683] [2020-02-10 20:45:56,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:56,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305290683] [2020-02-10 20:45:56,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:56,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:56,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650617128] [2020-02-10 20:45:56,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:56,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:56,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:56,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:56,967 INFO L87 Difference]: Start difference. First operand 785 states and 3122 transitions. Second operand 10 states. [2020-02-10 20:45:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:57,106 INFO L93 Difference]: Finished difference Result 1412 states and 4933 transitions. [2020-02-10 20:45:57,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:57,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:57,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:57,111 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:45:57,111 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:45:57,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-02-10 20:45:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:45:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 794. [2020-02-10 20:45:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:45:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3147 transitions. [2020-02-10 20:45:57,135 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3147 transitions. Word has length 25 [2020-02-10 20:45:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:57,135 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3147 transitions. [2020-02-10 20:45:57,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3147 transitions. [2020-02-10 20:45:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:57,136 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:57,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-02-10 20:45:57,136 INFO L427 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-02-10 20:45:57,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:57,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2026200009, now seen corresponding path program 542 times [2020-02-10 20:45:57,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:57,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555445783] [2020-02-10 20:45:57,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:57,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555445783] [2020-02-10 20:45:57,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:57,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:57,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464743329] [2020-02-10 20:45:57,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:57,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:57,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:57,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:57,544 INFO L87 Difference]: Start difference. First operand 794 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:45:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:57,687 INFO L93 Difference]: Finished difference Result 1413 states and 4931 transitions. [2020-02-10 20:45:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:57,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:57,691 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 20:45:57,691 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 20:45:57,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 20:45:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 790. [2020-02-10 20:45:57,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:45:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3136 transitions. [2020-02-10 20:45:57,715 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3136 transitions. Word has length 25 [2020-02-10 20:45:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:57,715 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3136 transitions. [2020-02-10 20:45:57,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3136 transitions. [2020-02-10 20:45:57,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:57,716 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:57,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-02-10 20:45:57,716 INFO L427 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-02-10 20:45:57,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:57,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1101926857, now seen corresponding path program 543 times [2020-02-10 20:45:57,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:57,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874702] [2020-02-10 20:45:57,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:58,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-02-10 20:45:58,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874702] [2020-02-10 20:45:58,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:58,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:58,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692387266] [2020-02-10 20:45:58,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:58,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:58,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:58,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:58,114 INFO L87 Difference]: Start difference. First operand 790 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:45:58,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:58,250 INFO L93 Difference]: Finished difference Result 1417 states and 4938 transitions. [2020-02-10 20:45:58,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:58,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:58,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:58,255 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 20:45:58,255 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 20:45:58,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 20:45:58,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 795. [2020-02-10 20:45:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:45:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-02-10 20:45:58,279 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-02-10 20:45:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:58,279 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-02-10 20:45:58,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-02-10 20:45:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:58,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:58,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-02-10 20:45:58,280 INFO L427 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-02-10 20:45:58,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:58,280 INFO L82 PathProgramCache]: Analyzing trace with hash -89662827, now seen corresponding path program 544 times [2020-02-10 20:45:58,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:58,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196089394] [2020-02-10 20:45:58,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:58,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196089394] [2020-02-10 20:45:58,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:58,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:58,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449663476] [2020-02-10 20:45:58,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:58,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:58,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:58,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:58,689 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:45:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:58,832 INFO L93 Difference]: Finished difference Result 1422 states and 4943 transitions. [2020-02-10 20:45:58,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:58,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:58,835 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:45:58,836 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:45:58,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-02-10 20:45:58,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:45:58,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-02-10 20:45:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:45:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3131 transitions. [2020-02-10 20:45:58,859 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3131 transitions. Word has length 25 [2020-02-10 20:45:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:58,860 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3131 transitions. [2020-02-10 20:45:58,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3131 transitions. [2020-02-10 20:45:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:58,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:58,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-02-10 20:45:58,861 INFO L427 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-02-10 20:45:58,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:58,861 INFO L82 PathProgramCache]: Analyzing trace with hash -710786151, now seen corresponding path program 545 times [2020-02-10 20:45:58,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:58,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677545472] [2020-02-10 20:45:58,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:59,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677545472] [2020-02-10 20:45:59,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:59,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:59,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931126815] [2020-02-10 20:45:59,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:59,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:59,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:59,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:59,269 INFO L87 Difference]: Start difference. First operand 790 states and 3131 transitions. Second operand 10 states. [2020-02-10 20:45:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:59,404 INFO L93 Difference]: Finished difference Result 1420 states and 4940 transitions. [2020-02-10 20:45:59,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:59,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:59,407 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 20:45:59,408 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:45:59,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:45:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:45:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 796. [2020-02-10 20:45:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:45:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3142 transitions. [2020-02-10 20:45:59,433 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3142 transitions. Word has length 25 [2020-02-10 20:45:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:59,433 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3142 transitions. [2020-02-10 20:45:59,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:59,433 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3142 transitions. [2020-02-10 20:45:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:59,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:59,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-02-10 20:45:59,434 INFO L427 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-02-10 20:45:59,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:45:59,435 INFO L82 PathProgramCache]: Analyzing trace with hash 900154807, now seen corresponding path program 546 times [2020-02-10 20:45:59,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:45:59,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580923103] [2020-02-10 20:45:59,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:45:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:45:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:45:59,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580923103] [2020-02-10 20:45:59,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:45:59,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:45:59,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318863768] [2020-02-10 20:45:59,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:45:59,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:45:59,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:45:59,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:45:59,857 INFO L87 Difference]: Start difference. First operand 796 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:45:59,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:45:59,968 INFO L93 Difference]: Finished difference Result 1424 states and 4942 transitions. [2020-02-10 20:45:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:45:59,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:45:59,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:45:59,972 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 20:45:59,972 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 20:45:59,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-02-10 20:45:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 20:45:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 785. [2020-02-10 20:45:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:45:59,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3118 transitions. [2020-02-10 20:45:59,997 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3118 transitions. Word has length 25 [2020-02-10 20:45:59,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:45:59,998 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3118 transitions. [2020-02-10 20:45:59,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:45:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3118 transitions. [2020-02-10 20:45:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:45:59,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:45:59,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-02-10 20:45:59,999 INFO L427 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-02-10 20:45:59,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:00,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1518875627, now seen corresponding path program 547 times [2020-02-10 20:46:00,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:00,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9332552] [2020-02-10 20:46:00,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:00,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:00,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9332552] [2020-02-10 20:46:00,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:00,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:00,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537854029] [2020-02-10 20:46:00,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:00,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:00,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:00,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:00,404 INFO L87 Difference]: Start difference. First operand 785 states and 3118 transitions. Second operand 10 states. [2020-02-10 20:46:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:00,537 INFO L93 Difference]: Finished difference Result 1405 states and 4910 transitions. [2020-02-10 20:46:00,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:00,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:00,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:00,541 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 20:46:00,542 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:46:00,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:46:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 792. [2020-02-10 20:46:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:46:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-02-10 20:46:00,566 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-02-10 20:46:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:00,566 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-02-10 20:46:00,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-02-10 20:46:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:00,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:00,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-02-10 20:46:00,568 INFO L427 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-02-10 20:46:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1703006289, now seen corresponding path program 548 times [2020-02-10 20:46:00,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:00,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502403040] [2020-02-10 20:46:00,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:00,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502403040] [2020-02-10 20:46:00,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:00,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:00,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632493350] [2020-02-10 20:46:00,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:00,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:00,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:00,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:00,987 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:46:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:01,124 INFO L93 Difference]: Finished difference Result 1407 states and 4911 transitions. [2020-02-10 20:46:01,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:01,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:01,128 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 20:46:01,128 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:46:01,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:46:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-02-10 20:46:01,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:46:01,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3129 transitions. [2020-02-10 20:46:01,152 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3129 transitions. Word has length 25 [2020-02-10 20:46:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:01,153 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3129 transitions. [2020-02-10 20:46:01,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3129 transitions. [2020-02-10 20:46:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:01,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:01,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-02-10 20:46:01,154 INFO L427 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-02-10 20:46:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1175653815, now seen corresponding path program 549 times [2020-02-10 20:46:01,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:01,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967047346] [2020-02-10 20:46:01,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:01,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967047346] [2020-02-10 20:46:01,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:01,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:01,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382022759] [2020-02-10 20:46:01,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:01,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:01,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:01,547 INFO L87 Difference]: Start difference. First operand 789 states and 3129 transitions. Second operand 10 states. [2020-02-10 20:46:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:01,694 INFO L93 Difference]: Finished difference Result 1410 states and 4916 transitions. [2020-02-10 20:46:01,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:01,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:01,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:01,698 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 20:46:01,698 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:46:01,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:46:01,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 20:46:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:46:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3136 transitions. [2020-02-10 20:46:01,723 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3136 transitions. Word has length 25 [2020-02-10 20:46:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:01,723 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3136 transitions. [2020-02-10 20:46:01,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3136 transitions. [2020-02-10 20:46:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:01,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:01,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-02-10 20:46:01,724 INFO L427 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-02-10 20:46:01,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:01,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1713509393, now seen corresponding path program 550 times [2020-02-10 20:46:01,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:01,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129820378] [2020-02-10 20:46:01,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:02,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:02,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129820378] [2020-02-10 20:46:02,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:02,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:02,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513690447] [2020-02-10 20:46:02,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:02,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:02,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:02,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:02,130 INFO L87 Difference]: Start difference. First operand 793 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:46:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:02,247 INFO L93 Difference]: Finished difference Result 1416 states and 4924 transitions. [2020-02-10 20:46:02,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:02,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:02,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:02,251 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:46:02,251 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:46:02,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:46:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 20:46:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:46:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3125 transitions. [2020-02-10 20:46:02,275 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3125 transitions. Word has length 25 [2020-02-10 20:46:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:02,275 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3125 transitions. [2020-02-10 20:46:02,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3125 transitions. [2020-02-10 20:46:02,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:02,276 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:02,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-02-10 20:46:02,276 INFO L427 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-02-10 20:46:02,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:02,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1196660023, now seen corresponding path program 551 times [2020-02-10 20:46:02,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:02,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532255605] [2020-02-10 20:46:02,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:02,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532255605] [2020-02-10 20:46:02,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:02,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:02,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988000804] [2020-02-10 20:46:02,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:02,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:02,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:02,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:02,683 INFO L87 Difference]: Start difference. First operand 789 states and 3125 transitions. Second operand 10 states. [2020-02-10 20:46:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:02,853 INFO L93 Difference]: Finished difference Result 1416 states and 4926 transitions. [2020-02-10 20:46:02,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:02,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:02,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:02,857 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:46:02,857 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:46:02,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-02-10 20:46:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:46:02,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 795. [2020-02-10 20:46:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:46:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3136 transitions. [2020-02-10 20:46:02,881 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3136 transitions. Word has length 25 [2020-02-10 20:46:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:02,881 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3136 transitions. [2020-02-10 20:46:02,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3136 transitions. [2020-02-10 20:46:02,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:02,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:02,883 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:02,883 INFO L427 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-02-10 20:46:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:02,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1487366315, now seen corresponding path program 552 times [2020-02-10 20:46:02,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:02,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296633106] [2020-02-10 20:46:02,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:03,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:03,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296633106] [2020-02-10 20:46:03,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:03,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:03,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113246456] [2020-02-10 20:46:03,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:03,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:03,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:03,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:03,292 INFO L87 Difference]: Start difference. First operand 795 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:46:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:03,403 INFO L93 Difference]: Finished difference Result 1420 states and 4928 transitions. [2020-02-10 20:46:03,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:03,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:03,408 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 20:46:03,408 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:46:03,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:46:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 781. [2020-02-10 20:46:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:46:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 20:46:03,432 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 20:46:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:03,433 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 20:46:03,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 20:46:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:03,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:03,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-02-10 20:46:03,434 INFO L427 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-02-10 20:46:03,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:03,434 INFO L82 PathProgramCache]: Analyzing trace with hash -26211883, now seen corresponding path program 553 times [2020-02-10 20:46:03,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:03,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786031147] [2020-02-10 20:46:03,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:03,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786031147] [2020-02-10 20:46:03,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:03,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:03,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579761894] [2020-02-10 20:46:03,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:03,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:03,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:03,832 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:46:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:03,973 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-02-10 20:46:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:03,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:03,978 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:46:03,978 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:46:03,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:46:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-02-10 20:46:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:46:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-02-10 20:46:04,002 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-02-10 20:46:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:04,002 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-02-10 20:46:04,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-02-10 20:46:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:04,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:04,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-02-10 20:46:04,003 INFO L427 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-02-10 20:46:04,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash 965045939, now seen corresponding path program 554 times [2020-02-10 20:46:04,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:04,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087366957] [2020-02-10 20:46:04,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:04,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087366957] [2020-02-10 20:46:04,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:04,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:04,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078649365] [2020-02-10 20:46:04,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:04,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:04,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:04,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:04,398 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:46:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:04,540 INFO L93 Difference]: Finished difference Result 1432 states and 4990 transitions. [2020-02-10 20:46:04,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:04,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:04,544 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:46:04,544 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:46:04,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-02-10 20:46:04,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:46:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 791. [2020-02-10 20:46:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:46:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3144 transitions. [2020-02-10 20:46:04,568 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3144 transitions. Word has length 25 [2020-02-10 20:46:04,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:04,568 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3144 transitions. [2020-02-10 20:46:04,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3144 transitions. [2020-02-10 20:46:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:04,570 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:04,570 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:04,570 INFO L427 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-02-10 20:46:04,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:04,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1899822195, now seen corresponding path program 555 times [2020-02-10 20:46:04,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:04,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051092301] [2020-02-10 20:46:04,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:04,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051092301] [2020-02-10 20:46:04,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:04,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:04,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751605168] [2020-02-10 20:46:04,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:04,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:04,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:04,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:04,985 INFO L87 Difference]: Start difference. First operand 791 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:46:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:05,121 INFO L93 Difference]: Finished difference Result 1427 states and 4980 transitions. [2020-02-10 20:46:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:05,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:05,124 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 20:46:05,124 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 20:46:05,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-02-10 20:46:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 20:46:05,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 795. [2020-02-10 20:46:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:46:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-02-10 20:46:05,151 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-02-10 20:46:05,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:05,151 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-02-10 20:46:05,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:05,151 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-02-10 20:46:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:05,152 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:05,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-02-10 20:46:05,152 INFO L427 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-02-10 20:46:05,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:05,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1393384175, now seen corresponding path program 556 times [2020-02-10 20:46:05,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:05,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812821895] [2020-02-10 20:46:05,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:05,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812821895] [2020-02-10 20:46:05,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:05,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:05,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979635633] [2020-02-10 20:46:05,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:05,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:05,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:05,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:05,555 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:46:05,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:05,691 INFO L93 Difference]: Finished difference Result 1428 states and 4978 transitions. [2020-02-10 20:46:05,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:05,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:05,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:05,694 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:46:05,695 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:46:05,695 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:46:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 791. [2020-02-10 20:46:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:46:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3140 transitions. [2020-02-10 20:46:05,718 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3140 transitions. Word has length 25 [2020-02-10 20:46:05,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:05,718 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3140 transitions. [2020-02-10 20:46:05,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:05,718 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3140 transitions. [2020-02-10 20:46:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:05,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:05,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-02-10 20:46:05,720 INFO L427 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-02-10 20:46:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:05,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1954863573, now seen corresponding path program 557 times [2020-02-10 20:46:05,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:05,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441771791] [2020-02-10 20:46:05,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:06,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441771791] [2020-02-10 20:46:06,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:06,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:06,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951354648] [2020-02-10 20:46:06,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:06,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:06,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:06,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:06,141 INFO L87 Difference]: Start difference. First operand 791 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:46:06,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:06,280 INFO L93 Difference]: Finished difference Result 1434 states and 4991 transitions. [2020-02-10 20:46:06,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:06,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:06,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:06,284 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:46:06,284 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:46:06,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:06,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:46:06,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 796. [2020-02-10 20:46:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:46:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3149 transitions. [2020-02-10 20:46:06,308 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3149 transitions. Word has length 25 [2020-02-10 20:46:06,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:06,308 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3149 transitions. [2020-02-10 20:46:06,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3149 transitions. [2020-02-10 20:46:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:06,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:06,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:06,310 INFO L427 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-02-10 20:46:06,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:06,310 INFO L82 PathProgramCache]: Analyzing trace with hash -729162765, now seen corresponding path program 558 times [2020-02-10 20:46:06,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:06,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148363171] [2020-02-10 20:46:06,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:06,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148363171] [2020-02-10 20:46:06,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:06,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:06,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605504161] [2020-02-10 20:46:06,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:06,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:06,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:06,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:06,701 INFO L87 Difference]: Start difference. First operand 796 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:46:06,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:06,837 INFO L93 Difference]: Finished difference Result 1432 states and 4982 transitions. [2020-02-10 20:46:06,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:06,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:06,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:06,840 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:46:06,840 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 20:46:06,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:06,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 20:46:06,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 787. [2020-02-10 20:46:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:46:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3129 transitions. [2020-02-10 20:46:06,865 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3129 transitions. Word has length 25 [2020-02-10 20:46:06,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:06,866 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3129 transitions. [2020-02-10 20:46:06,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3129 transitions. [2020-02-10 20:46:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:06,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:06,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-02-10 20:46:06,867 INFO L427 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-02-10 20:46:06,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:06,867 INFO L82 PathProgramCache]: Analyzing trace with hash -448697609, now seen corresponding path program 559 times [2020-02-10 20:46:06,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:06,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76949778] [2020-02-10 20:46:06,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:07,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76949778] [2020-02-10 20:46:07,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:07,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:07,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035373931] [2020-02-10 20:46:07,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:07,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:07,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:07,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:07,267 INFO L87 Difference]: Start difference. First operand 787 states and 3129 transitions. Second operand 10 states. [2020-02-10 20:46:07,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:07,435 INFO L93 Difference]: Finished difference Result 1440 states and 5007 transitions. [2020-02-10 20:46:07,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:07,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:07,439 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:46:07,439 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 20:46:07,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-02-10 20:46:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 20:46:07,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 797. [2020-02-10 20:46:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:46:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3156 transitions. [2020-02-10 20:46:07,464 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3156 transitions. Word has length 25 [2020-02-10 20:46:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:07,464 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3156 transitions. [2020-02-10 20:46:07,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3156 transitions. [2020-02-10 20:46:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:07,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:07,465 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:07,465 INFO L427 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-02-10 20:46:07,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:07,465 INFO L82 PathProgramCache]: Analyzing trace with hash 542560213, now seen corresponding path program 560 times [2020-02-10 20:46:07,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:07,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912495305] [2020-02-10 20:46:07,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:07,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912495305] [2020-02-10 20:46:07,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:07,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:07,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822941247] [2020-02-10 20:46:07,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:07,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:07,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:07,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:07,867 INFO L87 Difference]: Start difference. First operand 797 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:46:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:08,007 INFO L93 Difference]: Finished difference Result 1443 states and 5009 transitions. [2020-02-10 20:46:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:08,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:08,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:08,011 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 20:46:08,011 INFO L226 Difference]: Without dead ends: 1423 [2020-02-10 20:46:08,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-02-10 20:46:08,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-02-10 20:46:08,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 793. [2020-02-10 20:46:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:46:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3145 transitions. [2020-02-10 20:46:08,035 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3145 transitions. Word has length 25 [2020-02-10 20:46:08,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:08,035 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3145 transitions. [2020-02-10 20:46:08,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:08,035 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3145 transitions. [2020-02-10 20:46:08,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:08,036 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:08,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-02-10 20:46:08,036 INFO L427 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-02-10 20:46:08,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:08,036 INFO L82 PathProgramCache]: Analyzing trace with hash -891596749, now seen corresponding path program 561 times [2020-02-10 20:46:08,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:08,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461050047] [2020-02-10 20:46:08,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:08,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461050047] [2020-02-10 20:46:08,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:08,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:08,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881780368] [2020-02-10 20:46:08,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:08,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:08,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:08,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:08,452 INFO L87 Difference]: Start difference. First operand 793 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:46:08,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:08,591 INFO L93 Difference]: Finished difference Result 1443 states and 5008 transitions. [2020-02-10 20:46:08,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:08,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:08,596 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 20:46:08,596 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 20:46:08,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-02-10 20:46:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 20:46:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 798. [2020-02-10 20:46:08,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:46:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3154 transitions. [2020-02-10 20:46:08,620 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3154 transitions. Word has length 25 [2020-02-10 20:46:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:08,620 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3154 transitions. [2020-02-10 20:46:08,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:08,620 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3154 transitions. [2020-02-10 20:46:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:08,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:08,621 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:08,621 INFO L427 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-02-10 20:46:08,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:08,622 INFO L82 PathProgramCache]: Analyzing trace with hash 120667281, now seen corresponding path program 562 times [2020-02-10 20:46:08,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:08,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720082423] [2020-02-10 20:46:08,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:09,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720082423] [2020-02-10 20:46:09,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:09,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:09,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188438931] [2020-02-10 20:46:09,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:09,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:09,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:09,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:09,044 INFO L87 Difference]: Start difference. First operand 798 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:46:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:09,168 INFO L93 Difference]: Finished difference Result 1448 states and 5013 transitions. [2020-02-10 20:46:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:09,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:09,172 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 20:46:09,172 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 20:46:09,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 20:46:09,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 793. [2020-02-10 20:46:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:46:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3140 transitions. [2020-02-10 20:46:09,196 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3140 transitions. Word has length 25 [2020-02-10 20:46:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:09,197 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3140 transitions. [2020-02-10 20:46:09,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3140 transitions. [2020-02-10 20:46:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:09,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:09,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-02-10 20:46:09,198 INFO L427 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-02-10 20:46:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:09,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1857974071, now seen corresponding path program 563 times [2020-02-10 20:46:09,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:09,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962513064] [2020-02-10 20:46:09,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:09,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962513064] [2020-02-10 20:46:09,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:09,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:09,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810440149] [2020-02-10 20:46:09,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:09,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:09,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:09,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:09,614 INFO L87 Difference]: Start difference. First operand 793 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:46:09,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:09,763 INFO L93 Difference]: Finished difference Result 1453 states and 5025 transitions. [2020-02-10 20:46:09,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:09,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:09,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:09,767 INFO L225 Difference]: With dead ends: 1453 [2020-02-10 20:46:09,767 INFO L226 Difference]: Without dead ends: 1437 [2020-02-10 20:46:09,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-02-10 20:46:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-02-10 20:46:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 802. [2020-02-10 20:46:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:46:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3156 transitions. [2020-02-10 20:46:09,794 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3156 transitions. Word has length 25 [2020-02-10 20:46:09,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:09,794 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3156 transitions. [2020-02-10 20:46:09,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3156 transitions. [2020-02-10 20:46:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:09,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:09,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-02-10 20:46:09,795 INFO L427 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-02-10 20:46:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:09,795 INFO L82 PathProgramCache]: Analyzing trace with hash 784888691, now seen corresponding path program 564 times [2020-02-10 20:46:09,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:09,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446879479] [2020-02-10 20:46:09,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:10,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446879479] [2020-02-10 20:46:10,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:10,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:10,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573323370] [2020-02-10 20:46:10,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:10,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:10,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:10,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:10,215 INFO L87 Difference]: Start difference. First operand 802 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:46:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:10,331 INFO L93 Difference]: Finished difference Result 1455 states and 5021 transitions. [2020-02-10 20:46:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:10,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:10,335 INFO L225 Difference]: With dead ends: 1455 [2020-02-10 20:46:10,335 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 20:46:10,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-02-10 20:46:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 20:46:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 787. [2020-02-10 20:46:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:46:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3123 transitions. [2020-02-10 20:46:10,359 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3123 transitions. Word has length 25 [2020-02-10 20:46:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:10,360 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3123 transitions. [2020-02-10 20:46:10,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3123 transitions. [2020-02-10 20:46:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:10,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:10,361 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:10,361 INFO L427 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-02-10 20:46:10,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:10,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1054850743, now seen corresponding path program 565 times [2020-02-10 20:46:10,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:10,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605016550] [2020-02-10 20:46:10,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:10,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605016550] [2020-02-10 20:46:10,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:10,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:10,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793376187] [2020-02-10 20:46:10,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:10,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:10,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:10,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:10,769 INFO L87 Difference]: Start difference. First operand 787 states and 3123 transitions. Second operand 10 states. [2020-02-10 20:46:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:10,921 INFO L93 Difference]: Finished difference Result 1432 states and 4984 transitions. [2020-02-10 20:46:10,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:10,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:10,925 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:46:10,925 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 20:46:10,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-02-10 20:46:10,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 20:46:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 796. [2020-02-10 20:46:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:46:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-02-10 20:46:10,950 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-02-10 20:46:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:10,950 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-02-10 20:46:10,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-02-10 20:46:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:10,951 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:10,951 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:10,951 INFO L427 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-02-10 20:46:10,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:10,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2056611669, now seen corresponding path program 566 times [2020-02-10 20:46:10,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:10,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127800334] [2020-02-10 20:46:10,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:11,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127800334] [2020-02-10 20:46:11,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:11,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:11,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976758948] [2020-02-10 20:46:11,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:11,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:11,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:11,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:11,371 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:46:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:11,545 INFO L93 Difference]: Finished difference Result 1433 states and 4982 transitions. [2020-02-10 20:46:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:11,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:11,549 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 20:46:11,550 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 20:46:11,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-02-10 20:46:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 20:46:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 792. [2020-02-10 20:46:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:46:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-02-10 20:46:11,574 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-02-10 20:46:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:11,574 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-02-10 20:46:11,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-02-10 20:46:11,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:11,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:11,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-02-10 20:46:11,576 INFO L427 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-02-10 20:46:11,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:11,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1314082475, now seen corresponding path program 567 times [2020-02-10 20:46:11,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:11,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295733110] [2020-02-10 20:46:11,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:11,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295733110] [2020-02-10 20:46:11,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:11,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:11,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015366105] [2020-02-10 20:46:11,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:11,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:11,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:11,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:11,974 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:46:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:12,122 INFO L93 Difference]: Finished difference Result 1437 states and 4989 transitions. [2020-02-10 20:46:12,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:12,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:12,126 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 20:46:12,126 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:46:12,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-02-10 20:46:12,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:46:12,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 797. [2020-02-10 20:46:12,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:46:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3146 transitions. [2020-02-10 20:46:12,150 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3146 transitions. Word has length 25 [2020-02-10 20:46:12,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:12,150 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3146 transitions. [2020-02-10 20:46:12,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3146 transitions. [2020-02-10 20:46:12,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:12,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:12,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:12,152 INFO L427 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-02-10 20:46:12,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:12,152 INFO L82 PathProgramCache]: Analyzing trace with hash -301818445, now seen corresponding path program 568 times [2020-02-10 20:46:12,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:12,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523348103] [2020-02-10 20:46:12,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:12,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523348103] [2020-02-10 20:46:12,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:12,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:12,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460475318] [2020-02-10 20:46:12,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:12,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:12,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:12,567 INFO L87 Difference]: Start difference. First operand 797 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:46:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:12,684 INFO L93 Difference]: Finished difference Result 1442 states and 4994 transitions. [2020-02-10 20:46:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:12,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:12,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:12,688 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 20:46:12,688 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 20:46:12,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 20:46:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 792. [2020-02-10 20:46:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:46:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3132 transitions. [2020-02-10 20:46:12,712 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3132 transitions. Word has length 25 [2020-02-10 20:46:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:12,713 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3132 transitions. [2020-02-10 20:46:12,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3132 transitions. [2020-02-10 20:46:12,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:12,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:12,714 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:12,714 INFO L427 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-02-10 20:46:12,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:12,714 INFO L82 PathProgramCache]: Analyzing trace with hash -922941769, now seen corresponding path program 569 times [2020-02-10 20:46:12,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:12,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988358828] [2020-02-10 20:46:12,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:13,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988358828] [2020-02-10 20:46:13,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:13,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:13,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816326468] [2020-02-10 20:46:13,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:13,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:13,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:13,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:13,177 INFO L87 Difference]: Start difference. First operand 792 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:46:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:13,326 INFO L93 Difference]: Finished difference Result 1440 states and 4991 transitions. [2020-02-10 20:46:13,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:13,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:13,330 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:46:13,330 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 20:46:13,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-02-10 20:46:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 20:46:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 798. [2020-02-10 20:46:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:46:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3143 transitions. [2020-02-10 20:46:13,354 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3143 transitions. Word has length 25 [2020-02-10 20:46:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:13,355 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3143 transitions. [2020-02-10 20:46:13,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:13,355 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3143 transitions. [2020-02-10 20:46:13,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:13,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:13,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-02-10 20:46:13,356 INFO L427 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-02-10 20:46:13,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:13,356 INFO L82 PathProgramCache]: Analyzing trace with hash 687999189, now seen corresponding path program 570 times [2020-02-10 20:46:13,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:13,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516410927] [2020-02-10 20:46:13,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:13,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516410927] [2020-02-10 20:46:13,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:13,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:13,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489956726] [2020-02-10 20:46:13,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:13,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:13,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:13,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:13,779 INFO L87 Difference]: Start difference. First operand 798 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:46:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:13,956 INFO L93 Difference]: Finished difference Result 1444 states and 4993 transitions. [2020-02-10 20:46:13,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:13,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:13,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:13,960 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 20:46:13,960 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 20:46:13,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 20:46:13,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 787. [2020-02-10 20:46:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:46:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3118 transitions. [2020-02-10 20:46:13,985 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3118 transitions. Word has length 25 [2020-02-10 20:46:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:13,985 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3118 transitions. [2020-02-10 20:46:13,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3118 transitions. [2020-02-10 20:46:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:13,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:13,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-02-10 20:46:13,986 INFO L427 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-02-10 20:46:13,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:13,986 INFO L82 PathProgramCache]: Analyzing trace with hash -216979789, now seen corresponding path program 571 times [2020-02-10 20:46:13,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:13,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182166908] [2020-02-10 20:46:13,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:14,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182166908] [2020-02-10 20:46:14,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:14,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:14,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475723125] [2020-02-10 20:46:14,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:14,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:14,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:14,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:14,388 INFO L87 Difference]: Start difference. First operand 787 states and 3118 transitions. Second operand 10 states. [2020-02-10 20:46:14,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:14,537 INFO L93 Difference]: Finished difference Result 1449 states and 5019 transitions. [2020-02-10 20:46:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:14,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:14,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:14,541 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:46:14,542 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 20:46:14,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 20:46:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 799. [2020-02-10 20:46:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:46:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3151 transitions. [2020-02-10 20:46:14,566 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3151 transitions. Word has length 25 [2020-02-10 20:46:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:14,566 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3151 transitions. [2020-02-10 20:46:14,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3151 transitions. [2020-02-10 20:46:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:14,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:14,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-02-10 20:46:14,567 INFO L427 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-02-10 20:46:14,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1393961169, now seen corresponding path program 572 times [2020-02-10 20:46:14,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:14,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404565703] [2020-02-10 20:46:14,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:14,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404565703] [2020-02-10 20:46:14,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:14,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:14,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993257545] [2020-02-10 20:46:14,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:14,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:14,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:14,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:14,969 INFO L87 Difference]: Start difference. First operand 799 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:46:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:15,118 INFO L93 Difference]: Finished difference Result 1447 states and 5010 transitions. [2020-02-10 20:46:15,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:15,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:15,122 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:46:15,122 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:46:15,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-02-10 20:46:15,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:46:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 794. [2020-02-10 20:46:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:46:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-02-10 20:46:15,147 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-02-10 20:46:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:15,147 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-02-10 20:46:15,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-02-10 20:46:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:15,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:15,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-02-10 20:46:15,148 INFO L427 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-02-10 20:46:15,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:15,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1817417643, now seen corresponding path program 573 times [2020-02-10 20:46:15,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:15,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569320616] [2020-02-10 20:46:15,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:15,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569320616] [2020-02-10 20:46:15,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:15,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:15,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59326008] [2020-02-10 20:46:15,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:15,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:15,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:15,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:15,568 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:46:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:15,762 INFO L93 Difference]: Finished difference Result 1457 states and 5030 transitions. [2020-02-10 20:46:15,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:15,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:15,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:15,766 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:46:15,766 INFO L226 Difference]: Without dead ends: 1441 [2020-02-10 20:46:15,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:15,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2020-02-10 20:46:15,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 803. [2020-02-10 20:46:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:46:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3153 transitions. [2020-02-10 20:46:15,790 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3153 transitions. Word has length 25 [2020-02-10 20:46:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:15,791 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3153 transitions. [2020-02-10 20:46:15,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3153 transitions. [2020-02-10 20:46:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:15,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:15,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-02-10 20:46:15,792 INFO L427 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-02-10 20:46:15,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:15,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1404464273, now seen corresponding path program 574 times [2020-02-10 20:46:15,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:15,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182688364] [2020-02-10 20:46:15,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:16,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182688364] [2020-02-10 20:46:16,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:16,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:16,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201373367] [2020-02-10 20:46:16,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:16,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:16,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:16,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:16,215 INFO L87 Difference]: Start difference. First operand 803 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:46:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:16,345 INFO L93 Difference]: Finished difference Result 1459 states and 5026 transitions. [2020-02-10 20:46:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:16,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:16,349 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 20:46:16,349 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:46:16,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-02-10 20:46:16,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:46:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 794. [2020-02-10 20:46:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:46:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3130 transitions. [2020-02-10 20:46:16,373 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3130 transitions. Word has length 25 [2020-02-10 20:46:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:16,374 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3130 transitions. [2020-02-10 20:46:16,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3130 transitions. [2020-02-10 20:46:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:16,375 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:16,375 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:16,375 INFO L427 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-02-10 20:46:16,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:16,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1806914539, now seen corresponding path program 575 times [2020-02-10 20:46:16,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:16,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657820873] [2020-02-10 20:46:16,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:16,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:16,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657820873] [2020-02-10 20:46:16,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:16,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:16,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919680471] [2020-02-10 20:46:16,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:16,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:16,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:16,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:16,787 INFO L87 Difference]: Start difference. First operand 794 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:46:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:16,937 INFO L93 Difference]: Finished difference Result 1450 states and 5008 transitions. [2020-02-10 20:46:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:16,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:16,941 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 20:46:16,941 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:46:16,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-02-10 20:46:16,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:46:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 800. [2020-02-10 20:46:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:46:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3141 transitions. [2020-02-10 20:46:16,984 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3141 transitions. Word has length 25 [2020-02-10 20:46:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:16,984 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3141 transitions. [2020-02-10 20:46:16,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3141 transitions. [2020-02-10 20:46:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:16,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:16,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-02-10 20:46:16,986 INFO L427 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-02-10 20:46:16,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:16,986 INFO L82 PathProgramCache]: Analyzing trace with hash -195973581, now seen corresponding path program 576 times [2020-02-10 20:46:16,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:16,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088915325] [2020-02-10 20:46:16,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:17,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088915325] [2020-02-10 20:46:17,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:17,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:17,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607187830] [2020-02-10 20:46:17,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:17,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:17,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:17,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:17,403 INFO L87 Difference]: Start difference. First operand 800 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:46:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:17,536 INFO L93 Difference]: Finished difference Result 1454 states and 5010 transitions. [2020-02-10 20:46:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:17,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:17,540 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 20:46:17,540 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 20:46:17,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-02-10 20:46:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 20:46:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 781. [2020-02-10 20:46:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:46:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-02-10 20:46:17,565 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-02-10 20:46:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:17,565 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-02-10 20:46:17,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-02-10 20:46:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:17,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:17,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:17,566 INFO L427 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-02-10 20:46:17,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:17,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1108890727, now seen corresponding path program 577 times [2020-02-10 20:46:17,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:17,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462152795] [2020-02-10 20:46:17,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:17,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462152795] [2020-02-10 20:46:17,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:17,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:17,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072933206] [2020-02-10 20:46:17,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:17,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:17,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:17,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:17,979 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:46:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:18,161 INFO L93 Difference]: Finished difference Result 1414 states and 4936 transitions. [2020-02-10 20:46:18,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:18,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:18,165 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:46:18,165 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:46:18,165 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:46:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 792. [2020-02-10 20:46:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:46:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3139 transitions. [2020-02-10 20:46:18,190 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3139 transitions. Word has length 25 [2020-02-10 20:46:18,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:18,190 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3139 transitions. [2020-02-10 20:46:18,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3139 transitions. [2020-02-10 20:46:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:18,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:18,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-02-10 20:46:18,191 INFO L427 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-02-10 20:46:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash 502050231, now seen corresponding path program 578 times [2020-02-10 20:46:18,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:18,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138781144] [2020-02-10 20:46:18,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:18,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138781144] [2020-02-10 20:46:18,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:18,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:18,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667096641] [2020-02-10 20:46:18,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:18,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:18,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:18,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:18,579 INFO L87 Difference]: Start difference. First operand 792 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:46:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:18,742 INFO L93 Difference]: Finished difference Result 1418 states and 4941 transitions. [2020-02-10 20:46:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:18,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:18,746 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:46:18,746 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:46:18,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-02-10 20:46:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:46:18,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 789. [2020-02-10 20:46:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:46:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3131 transitions. [2020-02-10 20:46:18,771 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3131 transitions. Word has length 25 [2020-02-10 20:46:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:18,771 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3131 transitions. [2020-02-10 20:46:18,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3131 transitions. [2020-02-10 20:46:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:18,772 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:18,772 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:18,772 INFO L427 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-02-10 20:46:18,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1585638715, now seen corresponding path program 579 times [2020-02-10 20:46:18,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:18,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008223674] [2020-02-10 20:46:18,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46: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-02-10 20:46:19,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008223674] [2020-02-10 20:46:19,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:19,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:19,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986040531] [2020-02-10 20:46:19,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:19,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:19,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:19,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:19,163 INFO L87 Difference]: Start difference. First operand 789 states and 3131 transitions. Second operand 10 states. [2020-02-10 20:46:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:19,325 INFO L93 Difference]: Finished difference Result 1412 states and 4929 transitions. [2020-02-10 20:46:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:19,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:19,329 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:46:19,329 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 20:46:19,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 20:46:19,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 792. [2020-02-10 20:46:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:46:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3136 transitions. [2020-02-10 20:46:19,353 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3136 transitions. Word has length 25 [2020-02-10 20:46:19,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:19,353 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3136 transitions. [2020-02-10 20:46:19,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3136 transitions. [2020-02-10 20:46:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:19,355 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:19,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-02-10 20:46:19,355 INFO L427 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-02-10 20:46:19,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:19,355 INFO L82 PathProgramCache]: Analyzing trace with hash 512553335, now seen corresponding path program 580 times [2020-02-10 20:46:19,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:19,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787387830] [2020-02-10 20:46:19,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:19,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787387830] [2020-02-10 20:46:19,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:19,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:19,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821192424] [2020-02-10 20:46:19,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:19,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:19,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:19,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:19,738 INFO L87 Difference]: Start difference. First operand 792 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:46:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:19,905 INFO L93 Difference]: Finished difference Result 1414 states and 4930 transitions. [2020-02-10 20:46:19,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:19,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:19,909 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:46:19,909 INFO L226 Difference]: Without dead ends: 1397 [2020-02-10 20:46:19,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-02-10 20:46:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 789. [2020-02-10 20:46:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:46:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3128 transitions. [2020-02-10 20:46:19,933 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3128 transitions. Word has length 25 [2020-02-10 20:46:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:19,933 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3128 transitions. [2020-02-10 20:46:19,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3128 transitions. [2020-02-10 20:46:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:19,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:19,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-02-10 20:46:19,935 INFO L427 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-02-10 20:46:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:19,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1596141819, now seen corresponding path program 581 times [2020-02-10 20:46:19,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:19,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634074114] [2020-02-10 20:46:19,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:20,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634074114] [2020-02-10 20:46:20,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:20,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:20,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408382166] [2020-02-10 20:46:20,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:20,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:20,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:20,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:20,336 INFO L87 Difference]: Start difference. First operand 789 states and 3128 transitions. Second operand 10 states. [2020-02-10 20:46:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:20,496 INFO L93 Difference]: Finished difference Result 1422 states and 4948 transitions. [2020-02-10 20:46:20,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:20,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:20,500 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:46:20,500 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:46:20,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-02-10 20:46:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:46:20,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 20:46:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:46:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-02-10 20:46:20,524 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-02-10 20:46:20,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:20,524 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-02-10 20:46:20,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-02-10 20:46:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:20,526 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:20,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:20,526 INFO L427 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-02-10 20:46:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:20,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1087884519, now seen corresponding path program 582 times [2020-02-10 20:46:20,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:20,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629161332] [2020-02-10 20:46:20,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:20,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629161332] [2020-02-10 20:46:20,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:20,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:20,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645699177] [2020-02-10 20:46:20,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:20,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:20,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:20,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:20,916 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:46:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:21,081 INFO L93 Difference]: Finished difference Result 1420 states and 4939 transitions. [2020-02-10 20:46:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:21,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:21,085 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 20:46:21,086 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:46:21,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:46:21,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 786. [2020-02-10 20:46:21,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:46:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3120 transitions. [2020-02-10 20:46:21,110 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3120 transitions. Word has length 25 [2020-02-10 20:46:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:21,110 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3120 transitions. [2020-02-10 20:46:21,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3120 transitions. [2020-02-10 20:46:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:21,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:21,111 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:21,111 INFO L427 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-02-10 20:46:21,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:21,111 INFO L82 PathProgramCache]: Analyzing trace with hash 817143351, now seen corresponding path program 583 times [2020-02-10 20:46:21,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:21,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120995342] [2020-02-10 20:46:21,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:21,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120995342] [2020-02-10 20:46:21,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:21,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:21,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145700508] [2020-02-10 20:46:21,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:21,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:21,528 INFO L87 Difference]: Start difference. First operand 786 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:46:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:21,672 INFO L93 Difference]: Finished difference Result 1425 states and 4956 transitions. [2020-02-10 20:46:21,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:21,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:21,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:21,676 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 20:46:21,677 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 20:46:21,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 20:46:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 794. [2020-02-10 20:46:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:46:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3141 transitions. [2020-02-10 20:46:21,700 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3141 transitions. Word has length 25 [2020-02-10 20:46:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:21,701 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3141 transitions. [2020-02-10 20:46:21,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3141 transitions. [2020-02-10 20:46:21,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:21,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:21,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:21,702 INFO L427 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-02-10 20:46:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:21,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1866882987, now seen corresponding path program 584 times [2020-02-10 20:46:21,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:21,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64303457] [2020-02-10 20:46:21,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:22,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64303457] [2020-02-10 20:46:22,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:22,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:22,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392488634] [2020-02-10 20:46:22,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:22,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:22,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:22,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:22,083 INFO L87 Difference]: Start difference. First operand 794 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:46:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:22,213 INFO L93 Difference]: Finished difference Result 1429 states and 4961 transitions. [2020-02-10 20:46:22,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:22,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:22,217 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:46:22,217 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:46:22,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-02-10 20:46:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:46:22,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 791. [2020-02-10 20:46:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:46:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3133 transitions. [2020-02-10 20:46:22,242 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3133 transitions. Word has length 25 [2020-02-10 20:46:22,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:22,242 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3133 transitions. [2020-02-10 20:46:22,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3133 transitions. [2020-02-10 20:46:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:22,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:22,243 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:22,243 INFO L427 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-02-10 20:46:22,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:22,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1911234939, now seen corresponding path program 585 times [2020-02-10 20:46:22,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:22,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538151659] [2020-02-10 20:46:22,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:22,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538151659] [2020-02-10 20:46:22,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:22,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:22,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816937234] [2020-02-10 20:46:22,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:22,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:22,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:22,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:22,626 INFO L87 Difference]: Start difference. First operand 791 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:46:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:22,758 INFO L93 Difference]: Finished difference Result 1428 states and 4958 transitions. [2020-02-10 20:46:22,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:22,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:22,762 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:46:22,762 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:46:22,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-02-10 20:46:22,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:46:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-02-10 20:46:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:46:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3140 transitions. [2020-02-10 20:46:22,787 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3140 transitions. Word has length 25 [2020-02-10 20:46:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:22,787 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3140 transitions. [2020-02-10 20:46:22,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3140 transitions. [2020-02-10 20:46:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:22,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:22,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:22,788 INFO L427 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-02-10 20:46:22,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:22,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1845876779, now seen corresponding path program 586 times [2020-02-10 20:46:22,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:22,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754161519] [2020-02-10 20:46:22,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:23,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754161519] [2020-02-10 20:46:23,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:23,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:23,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193151505] [2020-02-10 20:46:23,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:23,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:23,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:23,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:23,175 INFO L87 Difference]: Start difference. First operand 795 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:46:23,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:23,307 INFO L93 Difference]: Finished difference Result 1434 states and 4966 transitions. [2020-02-10 20:46:23,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:23,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:23,311 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:46:23,312 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:46:23,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:46:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 791. [2020-02-10 20:46:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:46:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3129 transitions. [2020-02-10 20:46:23,336 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3129 transitions. Word has length 25 [2020-02-10 20:46:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:23,336 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3129 transitions. [2020-02-10 20:46:23,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3129 transitions. [2020-02-10 20:46:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:23,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:23,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-02-10 20:46:23,337 INFO L427 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-02-10 20:46:23,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1921738043, now seen corresponding path program 587 times [2020-02-10 20:46:23,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:23,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051389454] [2020-02-10 20:46:23,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:23,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051389454] [2020-02-10 20:46:23,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:23,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:23,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026416577] [2020-02-10 20:46:23,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:23,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:23,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:23,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:23,733 INFO L87 Difference]: Start difference. First operand 791 states and 3129 transitions. Second operand 10 states. [2020-02-10 20:46:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:23,888 INFO L93 Difference]: Finished difference Result 1441 states and 4983 transitions. [2020-02-10 20:46:23,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:23,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:23,892 INFO L225 Difference]: With dead ends: 1441 [2020-02-10 20:46:23,892 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 20:46:23,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-02-10 20:46:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 20:46:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 800. [2020-02-10 20:46:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:46:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3145 transitions. [2020-02-10 20:46:23,917 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3145 transitions. Word has length 25 [2020-02-10 20:46:23,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:23,917 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3145 transitions. [2020-02-10 20:46:23,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:23,918 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3145 transitions. [2020-02-10 20:46:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:23,918 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:23,919 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:23,919 INFO L427 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-02-10 20:46:23,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:23,919 INFO L82 PathProgramCache]: Analyzing trace with hash 848652663, now seen corresponding path program 588 times [2020-02-10 20:46:23,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:23,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343498856] [2020-02-10 20:46:23,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:24,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-02-10 20:46:24,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343498856] [2020-02-10 20:46:24,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:24,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:24,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039930255] [2020-02-10 20:46:24,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:24,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:24,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:24,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:24,324 INFO L87 Difference]: Start difference. First operand 800 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:46:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:24,444 INFO L93 Difference]: Finished difference Result 1443 states and 4979 transitions. [2020-02-10 20:46:24,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:24,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:24,448 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 20:46:24,448 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 20:46:24,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:24,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 20:46:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 786. [2020-02-10 20:46:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:46:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3115 transitions. [2020-02-10 20:46:24,473 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3115 transitions. Word has length 25 [2020-02-10 20:46:24,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:24,473 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3115 transitions. [2020-02-10 20:46:24,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3115 transitions. [2020-02-10 20:46:24,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:24,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:24,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:24,474 INFO L427 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-02-10 20:46:24,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:24,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1142739575, now seen corresponding path program 589 times [2020-02-10 20:46:24,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:24,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101468402] [2020-02-10 20:46:24,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:24,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101468402] [2020-02-10 20:46:24,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:24,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:24,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217244031] [2020-02-10 20:46:24,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:24,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:24,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:24,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:24,867 INFO L87 Difference]: Start difference. First operand 786 states and 3115 transitions. Second operand 10 states. [2020-02-10 20:46:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:25,023 INFO L93 Difference]: Finished difference Result 1417 states and 4934 transitions. [2020-02-10 20:46:25,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:25,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:25,026 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 20:46:25,027 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 20:46:25,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-02-10 20:46:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 20:46:25,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 793. [2020-02-10 20:46:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:46:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3134 transitions. [2020-02-10 20:46:25,050 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3134 transitions. Word has length 25 [2020-02-10 20:46:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:25,051 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3134 transitions. [2020-02-10 20:46:25,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3134 transitions. [2020-02-10 20:46:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:25,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:25,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-02-10 20:46:25,052 INFO L427 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-02-10 20:46:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:25,052 INFO L82 PathProgramCache]: Analyzing trace with hash 69654195, now seen corresponding path program 590 times [2020-02-10 20:46:25,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:25,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217228050] [2020-02-10 20:46:25,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:25,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217228050] [2020-02-10 20:46:25,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:25,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:25,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250407324] [2020-02-10 20:46:25,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:25,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:25,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:25,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:25,476 INFO L87 Difference]: Start difference. First operand 793 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:46:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:25,608 INFO L93 Difference]: Finished difference Result 1419 states and 4935 transitions. [2020-02-10 20:46:25,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:25,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:25,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:25,612 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:46:25,612 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:46:25,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-02-10 20:46:25,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:46:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-02-10 20:46:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:46:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3126 transitions. [2020-02-10 20:46:25,637 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3126 transitions. Word has length 25 [2020-02-10 20:46:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:25,637 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3126 transitions. [2020-02-10 20:46:25,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3126 transitions. [2020-02-10 20:46:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:25,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:25,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-02-10 20:46:25,638 INFO L427 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-02-10 20:46:25,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:25,638 INFO L82 PathProgramCache]: Analyzing trace with hash -457698279, now seen corresponding path program 591 times [2020-02-10 20:46:25,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:25,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551877787] [2020-02-10 20:46:25,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:26,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551877787] [2020-02-10 20:46:26,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:26,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:26,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348139982] [2020-02-10 20:46:26,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:26,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:26,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:26,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:26,019 INFO L87 Difference]: Start difference. First operand 790 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:46:26,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:26,164 INFO L93 Difference]: Finished difference Result 1422 states and 4940 transitions. [2020-02-10 20:46:26,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:26,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:26,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:26,169 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:46:26,169 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:46:26,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-02-10 20:46:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:46:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 794. [2020-02-10 20:46:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:46:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3133 transitions. [2020-02-10 20:46:26,204 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3133 transitions. Word has length 25 [2020-02-10 20:46:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:26,204 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3133 transitions. [2020-02-10 20:46:26,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3133 transitions. [2020-02-10 20:46:26,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:26,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:26,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-02-10 20:46:26,206 INFO L427 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-02-10 20:46:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash 80157299, now seen corresponding path program 592 times [2020-02-10 20:46:26,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:26,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097215606] [2020-02-10 20:46:26,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:26,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097215606] [2020-02-10 20:46:26,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:26,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:26,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527377541] [2020-02-10 20:46:26,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:26,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:26,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:26,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:26,606 INFO L87 Difference]: Start difference. First operand 794 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:46:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:26,726 INFO L93 Difference]: Finished difference Result 1428 states and 4948 transitions. [2020-02-10 20:46:26,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:26,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:26,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:26,730 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:46:26,730 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:46:26,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:26,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:46:26,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 790. [2020-02-10 20:46:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:46:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3122 transitions. [2020-02-10 20:46:26,757 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3122 transitions. Word has length 25 [2020-02-10 20:46:26,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:26,757 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3122 transitions. [2020-02-10 20:46:26,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3122 transitions. [2020-02-10 20:46:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:26,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:26,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:26,759 INFO L427 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-02-10 20:46:26,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:26,759 INFO L82 PathProgramCache]: Analyzing trace with hash -436692071, now seen corresponding path program 593 times [2020-02-10 20:46:26,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:26,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688421138] [2020-02-10 20:46:26,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:27,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688421138] [2020-02-10 20:46:27,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:27,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:27,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689767577] [2020-02-10 20:46:27,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:27,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:27,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:27,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:27,153 INFO L87 Difference]: Start difference. First operand 790 states and 3122 transitions. Second operand 10 states. [2020-02-10 20:46:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:27,285 INFO L93 Difference]: Finished difference Result 1428 states and 4950 transitions. [2020-02-10 20:46:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:27,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:27,288 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:46:27,288 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 20:46:27,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:27,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 20:46:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 796. [2020-02-10 20:46:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:46:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3133 transitions. [2020-02-10 20:46:27,313 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3133 transitions. Word has length 25 [2020-02-10 20:46:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:27,313 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3133 transitions. [2020-02-10 20:46:27,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3133 transitions. [2020-02-10 20:46:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:27,314 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:27,314 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:27,314 INFO L427 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-02-10 20:46:27,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:27,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1174248887, now seen corresponding path program 594 times [2020-02-10 20:46:27,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:27,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696981917] [2020-02-10 20:46:27,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:27,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696981917] [2020-02-10 20:46:27,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:27,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:27,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578650504] [2020-02-10 20:46:27,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:27,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:27,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:27,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:27,741 INFO L87 Difference]: Start difference. First operand 796 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:46:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:27,876 INFO L93 Difference]: Finished difference Result 1432 states and 4952 transitions. [2020-02-10 20:46:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:27,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:27,880 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:46:27,880 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 20:46:27,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:27,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 20:46:27,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 786. [2020-02-10 20:46:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:46:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3111 transitions. [2020-02-10 20:46:27,905 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3111 transitions. Word has length 25 [2020-02-10 20:46:27,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:27,905 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3111 transitions. [2020-02-10 20:46:27,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:27,905 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3111 transitions. [2020-02-10 20:46:27,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:27,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:27,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-02-10 20:46:27,906 INFO L427 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-02-10 20:46:27,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:27,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1215690539, now seen corresponding path program 595 times [2020-02-10 20:46:27,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:27,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376204119] [2020-02-10 20:46:27,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:28,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376204119] [2020-02-10 20:46:28,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:28,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:28,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731690726] [2020-02-10 20:46:28,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:28,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:28,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:28,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:28,302 INFO L87 Difference]: Start difference. First operand 786 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:46:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:28,433 INFO L93 Difference]: Finished difference Result 1441 states and 4989 transitions. [2020-02-10 20:46:28,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:28,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:28,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:28,437 INFO L225 Difference]: With dead ends: 1441 [2020-02-10 20:46:28,437 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 20:46:28,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 20:46:28,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 798. [2020-02-10 20:46:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:46:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3144 transitions. [2020-02-10 20:46:28,462 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3144 transitions. Word has length 25 [2020-02-10 20:46:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:28,462 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3144 transitions. [2020-02-10 20:46:28,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3144 transitions. [2020-02-10 20:46:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:28,463 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:28,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-02-10 20:46:28,463 INFO L427 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-02-10 20:46:28,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:28,463 INFO L82 PathProgramCache]: Analyzing trace with hash 395250419, now seen corresponding path program 596 times [2020-02-10 20:46:28,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:28,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816503056] [2020-02-10 20:46:28,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:28,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816503056] [2020-02-10 20:46:28,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:28,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:28,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884118205] [2020-02-10 20:46:28,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:28,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:28,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:28,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:28,860 INFO L87 Difference]: Start difference. First operand 798 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:46:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:29,009 INFO L93 Difference]: Finished difference Result 1439 states and 4980 transitions. [2020-02-10 20:46:29,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:29,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:29,012 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 20:46:29,013 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 20:46:29,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 20:46:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 793. [2020-02-10 20:46:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:46:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3130 transitions. [2020-02-10 20:46:29,036 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3130 transitions. Word has length 25 [2020-02-10 20:46:29,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:29,036 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3130 transitions. [2020-02-10 20:46:29,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3130 transitions. [2020-02-10 20:46:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:29,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:29,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-02-10 20:46:29,038 INFO L427 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-02-10 20:46:29,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:29,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1478838903, now seen corresponding path program 597 times [2020-02-10 20:46:29,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:29,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587877787] [2020-02-10 20:46:29,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:29,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587877787] [2020-02-10 20:46:29,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:29,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:29,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449907684] [2020-02-10 20:46:29,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:29,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:29,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:29,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:29,439 INFO L87 Difference]: Start difference. First operand 793 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:46:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:29,597 INFO L93 Difference]: Finished difference Result 1449 states and 5000 transitions. [2020-02-10 20:46:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:29,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:29,601 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:46:29,601 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 20:46:29,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-02-10 20:46:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 20:46:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 802. [2020-02-10 20:46:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:46:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3146 transitions. [2020-02-10 20:46:29,626 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3146 transitions. Word has length 25 [2020-02-10 20:46:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:29,626 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3146 transitions. [2020-02-10 20:46:29,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3146 transitions. [2020-02-10 20:46:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:29,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:29,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:29,627 INFO L427 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-02-10 20:46:29,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:29,627 INFO L82 PathProgramCache]: Analyzing trace with hash 405753523, now seen corresponding path program 598 times [2020-02-10 20:46:29,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:29,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039920146] [2020-02-10 20:46:29,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:30,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039920146] [2020-02-10 20:46:30,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:30,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:30,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528117690] [2020-02-10 20:46:30,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:30,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:30,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:30,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:30,043 INFO L87 Difference]: Start difference. First operand 802 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:46:30,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:30,154 INFO L93 Difference]: Finished difference Result 1451 states and 4996 transitions. [2020-02-10 20:46:30,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:30,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:30,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:30,159 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 20:46:30,159 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:46:30,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:46:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 793. [2020-02-10 20:46:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:46:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3123 transitions. [2020-02-10 20:46:30,183 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3123 transitions. Word has length 25 [2020-02-10 20:46:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:30,183 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3123 transitions. [2020-02-10 20:46:30,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3123 transitions. [2020-02-10 20:46:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:30,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:30,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-02-10 20:46:30,184 INFO L427 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-02-10 20:46:30,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:30,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1489342007, now seen corresponding path program 599 times [2020-02-10 20:46:30,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:30,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659486879] [2020-02-10 20:46:30,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:30,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-02-10 20:46:30,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659486879] [2020-02-10 20:46:30,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:30,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:30,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301697782] [2020-02-10 20:46:30,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:30,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:30,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:30,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:30,581 INFO L87 Difference]: Start difference. First operand 793 states and 3123 transitions. Second operand 10 states. [2020-02-10 20:46:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:30,748 INFO L93 Difference]: Finished difference Result 1442 states and 4978 transitions. [2020-02-10 20:46:30,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:30,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:30,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:30,751 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 20:46:30,751 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:46:30,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:30,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:46:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 799. [2020-02-10 20:46:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:46:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3134 transitions. [2020-02-10 20:46:30,777 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3134 transitions. Word has length 25 [2020-02-10 20:46:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:30,777 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3134 transitions. [2020-02-10 20:46:30,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3134 transitions. [2020-02-10 20:46:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:30,778 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:30,779 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:30,779 INFO L427 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-02-10 20:46:30,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:30,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1194684331, now seen corresponding path program 600 times [2020-02-10 20:46:30,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:30,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252867342] [2020-02-10 20:46:30,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:31,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:31,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252867342] [2020-02-10 20:46:31,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:31,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:31,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968640681] [2020-02-10 20:46:31,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:31,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:31,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:31,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:31,195 INFO L87 Difference]: Start difference. First operand 799 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:46:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:31,323 INFO L93 Difference]: Finished difference Result 1446 states and 4980 transitions. [2020-02-10 20:46:31,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:31,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:31,327 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 20:46:31,327 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 20:46:31,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:31,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 20:46:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 776. [2020-02-10 20:46:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:46:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3088 transitions. [2020-02-10 20:46:31,352 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3088 transitions. Word has length 25 [2020-02-10 20:46:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:31,352 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3088 transitions. [2020-02-10 20:46:31,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3088 transitions. [2020-02-10 20:46:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:31,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:31,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-02-10 20:46:31,353 INFO L427 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-02-10 20:46:31,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:31,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2008365005, now seen corresponding path program 601 times [2020-02-10 20:46:31,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:31,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839353034] [2020-02-10 20:46:31,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:31,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839353034] [2020-02-10 20:46:31,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:31,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:31,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962747185] [2020-02-10 20:46:31,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:31,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:31,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:31,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:31,757 INFO L87 Difference]: Start difference. First operand 776 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:46:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:31,900 INFO L93 Difference]: Finished difference Result 1421 states and 4973 transitions. [2020-02-10 20:46:31,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:31,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:31,903 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:46:31,904 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:46:31,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-02-10 20:46:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:46:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 792. [2020-02-10 20:46:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:46:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 20:46:31,928 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 20:46:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:31,928 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 20:46:31,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 20:46:31,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:31,929 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:31,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-02-10 20:46:31,929 INFO L427 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-02-10 20:46:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:31,929 INFO L82 PathProgramCache]: Analyzing trace with hash -397424047, now seen corresponding path program 602 times [2020-02-10 20:46:31,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:31,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800722822] [2020-02-10 20:46:31,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:32,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800722822] [2020-02-10 20:46:32,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:32,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:32,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150511339] [2020-02-10 20:46:32,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:32,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:32,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:32,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:32,320 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:46:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:32,457 INFO L93 Difference]: Finished difference Result 1418 states and 4964 transitions. [2020-02-10 20:46:32,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:32,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:32,460 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:46:32,461 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:46:32,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:32,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:46:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 789. [2020-02-10 20:46:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:46:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3141 transitions. [2020-02-10 20:46:32,485 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3141 transitions. Word has length 25 [2020-02-10 20:46:32,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:32,485 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3141 transitions. [2020-02-10 20:46:32,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3141 transitions. [2020-02-10 20:46:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:32,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:32,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-02-10 20:46:32,486 INFO L427 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-02-10 20:46:32,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:32,486 INFO L82 PathProgramCache]: Analyzing trace with hash 686164437, now seen corresponding path program 603 times [2020-02-10 20:46:32,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:32,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324736155] [2020-02-10 20:46:32,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:32,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324736155] [2020-02-10 20:46:32,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:32,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:32,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400255198] [2020-02-10 20:46:32,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:32,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:32,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:32,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:32,883 INFO L87 Difference]: Start difference. First operand 789 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:46:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:33,013 INFO L93 Difference]: Finished difference Result 1428 states and 4987 transitions. [2020-02-10 20:46:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:33,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:33,017 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:46:33,017 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 20:46:33,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-02-10 20:46:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 20:46:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 795. [2020-02-10 20:46:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:46:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3152 transitions. [2020-02-10 20:46:33,041 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3152 transitions. Word has length 25 [2020-02-10 20:46:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:33,041 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3152 transitions. [2020-02-10 20:46:33,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3152 transitions. [2020-02-10 20:46:33,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:33,042 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:33,042 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:33,042 INFO L427 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-02-10 20:46:33,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:33,043 INFO L82 PathProgramCache]: Analyzing trace with hash -386920943, now seen corresponding path program 604 times [2020-02-10 20:46:33,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:33,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500857964] [2020-02-10 20:46:33,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:33,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500857964] [2020-02-10 20:46:33,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:33,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:33,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553742773] [2020-02-10 20:46:33,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:33,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:33,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:33,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:33,457 INFO L87 Difference]: Start difference. First operand 795 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:46:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:33,596 INFO L93 Difference]: Finished difference Result 1429 states and 4983 transitions. [2020-02-10 20:46:33,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:33,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:33,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:33,600 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:46:33,600 INFO L226 Difference]: Without dead ends: 1407 [2020-02-10 20:46:33,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:33,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-02-10 20:46:33,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 789. [2020-02-10 20:46:33,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:46:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3138 transitions. [2020-02-10 20:46:33,625 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3138 transitions. Word has length 25 [2020-02-10 20:46:33,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:33,625 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3138 transitions. [2020-02-10 20:46:33,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:33,625 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3138 transitions. [2020-02-10 20:46:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:33,626 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:33,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:33,627 INFO L427 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-02-10 20:46:33,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:33,627 INFO L82 PathProgramCache]: Analyzing trace with hash 696667541, now seen corresponding path program 605 times [2020-02-10 20:46:33,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:33,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494329293] [2020-02-10 20:46:33,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:34,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494329293] [2020-02-10 20:46:34,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:34,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:34,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878272982] [2020-02-10 20:46:34,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:34,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:34,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:34,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:34,026 INFO L87 Difference]: Start difference. First operand 789 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:46:34,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:34,159 INFO L93 Difference]: Finished difference Result 1419 states and 4963 transitions. [2020-02-10 20:46:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:34,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:34,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:34,163 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:46:34,164 INFO L226 Difference]: Without dead ends: 1407 [2020-02-10 20:46:34,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-02-10 20:46:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 792. [2020-02-10 20:46:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:46:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3143 transitions. [2020-02-10 20:46:34,187 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3143 transitions. Word has length 25 [2020-02-10 20:46:34,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:34,188 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3143 transitions. [2020-02-10 20:46:34,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3143 transitions. [2020-02-10 20:46:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:34,189 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:34,189 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:34,189 INFO L427 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-02-10 20:46:34,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:34,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1987358797, now seen corresponding path program 606 times [2020-02-10 20:46:34,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:34,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713330116] [2020-02-10 20:46:34,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:34,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-02-10 20:46:34,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713330116] [2020-02-10 20:46:34,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:34,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:34,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734983041] [2020-02-10 20:46:34,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:34,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:34,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:34,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:34,581 INFO L87 Difference]: Start difference. First operand 792 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:46:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:34,727 INFO L93 Difference]: Finished difference Result 1423 states and 4968 transitions. [2020-02-10 20:46:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:34,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:34,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:34,731 INFO L225 Difference]: With dead ends: 1423 [2020-02-10 20:46:34,732 INFO L226 Difference]: Without dead ends: 1401 [2020-02-10 20:46:34,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-02-10 20:46:34,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-02-10 20:46:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 786. [2020-02-10 20:46:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:46:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3130 transitions. [2020-02-10 20:46:34,757 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3130 transitions. Word has length 25 [2020-02-10 20:46:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:34,757 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3130 transitions. [2020-02-10 20:46:34,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3130 transitions. [2020-02-10 20:46:34,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:34,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:34,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:34,758 INFO L427 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-02-10 20:46:34,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:34,758 INFO L82 PathProgramCache]: Analyzing trace with hash -82330927, now seen corresponding path program 607 times [2020-02-10 20:46:34,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:34,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037814553] [2020-02-10 20:46:34,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:35,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037814553] [2020-02-10 20:46:35,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:35,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:35,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800013051] [2020-02-10 20:46:35,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:35,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:35,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:35,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:35,152 INFO L87 Difference]: Start difference. First operand 786 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:46:35,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:35,305 INFO L93 Difference]: Finished difference Result 1418 states and 4963 transitions. [2020-02-10 20:46:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:35,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:35,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:35,309 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:46:35,309 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:46:35,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-02-10 20:46:35,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:46:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 792. [2020-02-10 20:46:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:46:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3146 transitions. [2020-02-10 20:46:35,333 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3146 transitions. Word has length 25 [2020-02-10 20:46:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:35,333 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3146 transitions. [2020-02-10 20:46:35,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3146 transitions. [2020-02-10 20:46:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:35,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:35,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-02-10 20:46:35,335 INFO L427 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-02-10 20:46:35,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:35,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1528610031, now seen corresponding path program 608 times [2020-02-10 20:46:35,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:35,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211789133] [2020-02-10 20:46:35,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:35,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211789133] [2020-02-10 20:46:35,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:35,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:35,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576703244] [2020-02-10 20:46:35,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:35,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:35,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:35,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:35,726 INFO L87 Difference]: Start difference. First operand 792 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:46:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:35,881 INFO L93 Difference]: Finished difference Result 1415 states and 4954 transitions. [2020-02-10 20:46:35,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:35,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:35,885 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 20:46:35,885 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 20:46:35,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-02-10 20:46:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 20:46:35,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 789. [2020-02-10 20:46:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:46:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3138 transitions. [2020-02-10 20:46:35,910 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3138 transitions. Word has length 25 [2020-02-10 20:46:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:35,910 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3138 transitions. [2020-02-10 20:46:35,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3138 transitions. [2020-02-10 20:46:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:35,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:35,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-02-10 20:46:35,911 INFO L427 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-02-10 20:46:35,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:35,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1011760661, now seen corresponding path program 609 times [2020-02-10 20:46:35,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:35,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901840525] [2020-02-10 20:46:35,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:36,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901840525] [2020-02-10 20:46:36,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:36,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:36,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462992011] [2020-02-10 20:46:36,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:36,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:36,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:36,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:36,305 INFO L87 Difference]: Start difference. First operand 789 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:46:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:36,470 INFO L93 Difference]: Finished difference Result 1422 states and 4970 transitions. [2020-02-10 20:46:36,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:36,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:36,475 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:46:36,475 INFO L226 Difference]: Without dead ends: 1407 [2020-02-10 20:46:36,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-02-10 20:46:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 794. [2020-02-10 20:46:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:46:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3147 transitions. [2020-02-10 20:46:36,499 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3147 transitions. Word has length 25 [2020-02-10 20:46:36,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:36,499 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3147 transitions. [2020-02-10 20:46:36,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:36,499 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3147 transitions. [2020-02-10 20:46:36,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:36,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:36,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-02-10 20:46:36,500 INFO L427 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-02-10 20:46:36,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:36,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1549616239, now seen corresponding path program 610 times [2020-02-10 20:46:36,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:36,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712162993] [2020-02-10 20:46:36,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:36,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712162993] [2020-02-10 20:46:36,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:36,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:36,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874690648] [2020-02-10 20:46:36,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:36,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:36,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:36,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:36,887 INFO L87 Difference]: Start difference. First operand 794 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:46:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:37,037 INFO L93 Difference]: Finished difference Result 1421 states and 4963 transitions. [2020-02-10 20:46:37,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:37,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:37,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:37,042 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:46:37,042 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:46:37,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:46:37,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 789. [2020-02-10 20:46:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:46:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3135 transitions. [2020-02-10 20:46:37,065 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3135 transitions. Word has length 25 [2020-02-10 20:46:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:37,066 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3135 transitions. [2020-02-10 20:46:37,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3135 transitions. [2020-02-10 20:46:37,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:37,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:37,067 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:37,067 INFO L427 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-02-10 20:46:37,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:37,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1022263765, now seen corresponding path program 611 times [2020-02-10 20:46:37,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:37,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301580035] [2020-02-10 20:46:37,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:37,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301580035] [2020-02-10 20:46:37,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:37,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:37,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500775307] [2020-02-10 20:46:37,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:37,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:37,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:37,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:37,475 INFO L87 Difference]: Start difference. First operand 789 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:46:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:37,627 INFO L93 Difference]: Finished difference Result 1414 states and 4949 transitions. [2020-02-10 20:46:37,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:37,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:37,631 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:46:37,632 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:46:37,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-02-10 20:46:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:46:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 792. [2020-02-10 20:46:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:46:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3140 transitions. [2020-02-10 20:46:37,655 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3140 transitions. Word has length 25 [2020-02-10 20:46:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:37,656 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3140 transitions. [2020-02-10 20:46:37,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3140 transitions. [2020-02-10 20:46:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:37,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:37,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-02-10 20:46:37,657 INFO L427 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-02-10 20:46:37,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:37,657 INFO L82 PathProgramCache]: Analyzing trace with hash -50821615, now seen corresponding path program 612 times [2020-02-10 20:46:37,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:37,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398788191] [2020-02-10 20:46:37,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:38,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398788191] [2020-02-10 20:46:38,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:38,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:38,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537779944] [2020-02-10 20:46:38,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:38,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:38,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:38,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:38,049 INFO L87 Difference]: Start difference. First operand 792 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:46:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:38,209 INFO L93 Difference]: Finished difference Result 1416 states and 4950 transitions. [2020-02-10 20:46:38,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:38,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:38,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:38,213 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:46:38,213 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:46:38,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:46:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 786. [2020-02-10 20:46:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:46:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3127 transitions. [2020-02-10 20:46:38,237 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3127 transitions. Word has length 25 [2020-02-10 20:46:38,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:38,238 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3127 transitions. [2020-02-10 20:46:38,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3127 transitions. [2020-02-10 20:46:38,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:38,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:38,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-02-10 20:46:38,239 INFO L427 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-02-10 20:46:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:38,239 INFO L82 PathProgramCache]: Analyzing trace with hash 243265297, now seen corresponding path program 613 times [2020-02-10 20:46:38,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:38,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933230022] [2020-02-10 20:46:38,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:38,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933230022] [2020-02-10 20:46:38,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:38,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:38,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726263514] [2020-02-10 20:46:38,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:38,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:38,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:38,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:38,641 INFO L87 Difference]: Start difference. First operand 786 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:46:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:38,781 INFO L93 Difference]: Finished difference Result 1436 states and 5008 transitions. [2020-02-10 20:46:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:38,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:38,785 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 20:46:38,786 INFO L226 Difference]: Without dead ends: 1421 [2020-02-10 20:46:38,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-02-10 20:46:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-02-10 20:46:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 797. [2020-02-10 20:46:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:46:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3157 transitions. [2020-02-10 20:46:38,809 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3157 transitions. Word has length 25 [2020-02-10 20:46:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:38,810 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3157 transitions. [2020-02-10 20:46:38,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3157 transitions. [2020-02-10 20:46:38,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:38,811 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:38,811 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:38,811 INFO L427 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-02-10 20:46:38,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:38,811 INFO L82 PathProgramCache]: Analyzing trace with hash -829820083, now seen corresponding path program 614 times [2020-02-10 20:46:38,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:38,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233056453] [2020-02-10 20:46:38,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:39,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233056453] [2020-02-10 20:46:39,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:39,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:39,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998210582] [2020-02-10 20:46:39,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:39,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:39,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:39,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:39,223 INFO L87 Difference]: Start difference. First operand 797 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:46:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:39,376 INFO L93 Difference]: Finished difference Result 1437 states and 5004 transitions. [2020-02-10 20:46:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:39,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:39,380 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 20:46:39,380 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 20:46:39,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 20:46:39,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 791. [2020-02-10 20:46:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:46:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3141 transitions. [2020-02-10 20:46:39,404 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3141 transitions. Word has length 25 [2020-02-10 20:46:39,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:39,404 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3141 transitions. [2020-02-10 20:46:39,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:39,404 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3141 transitions. [2020-02-10 20:46:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:39,405 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:39,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-02-10 20:46:39,406 INFO L427 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-02-10 20:46:39,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:39,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1357172557, now seen corresponding path program 615 times [2020-02-10 20:46:39,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:39,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283236443] [2020-02-10 20:46:39,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:39,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:39,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283236443] [2020-02-10 20:46:39,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:39,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:39,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638087584] [2020-02-10 20:46:39,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:39,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:39,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:39,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:39,809 INFO L87 Difference]: Start difference. First operand 791 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:46:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:39,974 INFO L93 Difference]: Finished difference Result 1433 states and 4996 transitions. [2020-02-10 20:46:39,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:39,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:39,978 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 20:46:39,978 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:46:39,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-02-10 20:46:39,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:46:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 796. [2020-02-10 20:46:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:46:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3150 transitions. [2020-02-10 20:46:40,002 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3150 transitions. Word has length 25 [2020-02-10 20:46:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:40,003 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3150 transitions. [2020-02-10 20:46:40,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3150 transitions. [2020-02-10 20:46:40,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:40,004 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:40,004 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:40,004 INFO L427 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-02-10 20:46:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:40,004 INFO L82 PathProgramCache]: Analyzing trace with hash -819316979, now seen corresponding path program 616 times [2020-02-10 20:46:40,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:40,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474943593] [2020-02-10 20:46:40,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:40,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474943593] [2020-02-10 20:46:40,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:40,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:40,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087804601] [2020-02-10 20:46:40,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:40,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:40,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:40,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:40,408 INFO L87 Difference]: Start difference. First operand 796 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:46:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:40,562 INFO L93 Difference]: Finished difference Result 1432 states and 4989 transitions. [2020-02-10 20:46:40,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:40,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:40,566 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:46:40,566 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 20:46:40,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 20:46:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 791. [2020-02-10 20:46:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:46:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3136 transitions. [2020-02-10 20:46:40,590 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3136 transitions. Word has length 25 [2020-02-10 20:46:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:40,591 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3136 transitions. [2020-02-10 20:46:40,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3136 transitions. [2020-02-10 20:46:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:40,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:40,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-02-10 20:46:40,592 INFO L427 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-02-10 20:46:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1336166349, now seen corresponding path program 617 times [2020-02-10 20:46:40,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:40,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434732117] [2020-02-10 20:46:40,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:41,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434732117] [2020-02-10 20:46:41,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:41,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:41,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925820705] [2020-02-10 20:46:41,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:41,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:41,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:41,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:41,003 INFO L87 Difference]: Start difference. First operand 791 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:46:41,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:41,166 INFO L93 Difference]: Finished difference Result 1435 states and 4995 transitions. [2020-02-10 20:46:41,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:41,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:41,170 INFO L225 Difference]: With dead ends: 1435 [2020-02-10 20:46:41,171 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 20:46:41,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-02-10 20:46:41,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 20:46:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 796. [2020-02-10 20:46:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:46:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3145 transitions. [2020-02-10 20:46:41,197 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3145 transitions. Word has length 25 [2020-02-10 20:46:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:41,197 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3145 transitions. [2020-02-10 20:46:41,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3145 transitions. [2020-02-10 20:46:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:41,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:41,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-02-10 20:46:41,198 INFO L427 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-02-10 20:46:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 274774609, now seen corresponding path program 618 times [2020-02-10 20:46:41,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:41,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149194826] [2020-02-10 20:46:41,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:41,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:41,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149194826] [2020-02-10 20:46:41,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:41,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:41,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435773727] [2020-02-10 20:46:41,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:41,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:41,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:41,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:41,606 INFO L87 Difference]: Start difference. First operand 796 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:46:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:41,760 INFO L93 Difference]: Finished difference Result 1433 states and 4986 transitions. [2020-02-10 20:46:41,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:41,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:41,764 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 20:46:41,764 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 20:46:41,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:41,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 20:46:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 786. [2020-02-10 20:46:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:46:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3124 transitions. [2020-02-10 20:46:41,789 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3124 transitions. Word has length 25 [2020-02-10 20:46:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:41,789 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3124 transitions. [2020-02-10 20:46:41,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3124 transitions. [2020-02-10 20:46:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:41,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:41,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-02-10 20:46:41,790 INFO L427 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-02-10 20:46:41,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:41,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2115164817, now seen corresponding path program 619 times [2020-02-10 20:46:41,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:41,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483341204] [2020-02-10 20:46:41,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:42,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483341204] [2020-02-10 20:46:42,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:42,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:42,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632948711] [2020-02-10 20:46:42,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:42,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:42,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:42,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:42,171 INFO L87 Difference]: Start difference. First operand 786 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:46:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:42,307 INFO L93 Difference]: Finished difference Result 1417 states and 4955 transitions. [2020-02-10 20:46:42,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:42,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:42,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:42,311 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 20:46:42,312 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 20:46:42,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 20:46:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 792. [2020-02-10 20:46:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:46:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3140 transitions. [2020-02-10 20:46:42,337 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3140 transitions. Word has length 25 [2020-02-10 20:46:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:42,337 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3140 transitions. [2020-02-10 20:46:42,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3140 transitions. [2020-02-10 20:46:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:42,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:42,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-02-10 20:46:42,338 INFO L427 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-02-10 20:46:42,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:42,338 INFO L82 PathProgramCache]: Analyzing trace with hash -504223859, now seen corresponding path program 620 times [2020-02-10 20:46:42,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:42,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431427786] [2020-02-10 20:46:42,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:42,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431427786] [2020-02-10 20:46:42,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:42,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:42,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727547250] [2020-02-10 20:46:42,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:42,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:42,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:42,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:42,713 INFO L87 Difference]: Start difference. First operand 792 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:46:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:42,877 INFO L93 Difference]: Finished difference Result 1421 states and 4960 transitions. [2020-02-10 20:46:42,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:42,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:42,881 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:46:42,881 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:46:42,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-02-10 20:46:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:46:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 789. [2020-02-10 20:46:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:46:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3132 transitions. [2020-02-10 20:46:42,906 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3132 transitions. Word has length 25 [2020-02-10 20:46:42,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:42,906 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3132 transitions. [2020-02-10 20:46:42,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:42,906 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3132 transitions. [2020-02-10 20:46:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:42,907 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:42,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-02-10 20:46:42,908 INFO L427 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-02-10 20:46:42,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:42,908 INFO L82 PathProgramCache]: Analyzing trace with hash 579364625, now seen corresponding path program 621 times [2020-02-10 20:46:42,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:42,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779646306] [2020-02-10 20:46:42,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:43,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779646306] [2020-02-10 20:46:43,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:43,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:43,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955202386] [2020-02-10 20:46:43,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:43,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:43,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:43,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:43,298 INFO L87 Difference]: Start difference. First operand 789 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:46:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:43,454 INFO L93 Difference]: Finished difference Result 1415 states and 4948 transitions. [2020-02-10 20:46:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:43,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:43,458 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 20:46:43,458 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:46:43,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:43,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:46:43,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 792. [2020-02-10 20:46:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:46:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-02-10 20:46:43,482 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-02-10 20:46:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:43,482 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-02-10 20:46:43,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-02-10 20:46:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:43,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:43,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-02-10 20:46:43,483 INFO L427 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-02-10 20:46:43,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:43,484 INFO L82 PathProgramCache]: Analyzing trace with hash -493720755, now seen corresponding path program 622 times [2020-02-10 20:46:43,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:43,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344726322] [2020-02-10 20:46:43,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:43,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344726322] [2020-02-10 20:46:43,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:43,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:43,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186934292] [2020-02-10 20:46:43,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:43,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:43,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:43,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:43,861 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:46:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:44,008 INFO L93 Difference]: Finished difference Result 1417 states and 4949 transitions. [2020-02-10 20:46:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:44,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:44,012 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 20:46:44,012 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 20:46:44,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 20:46:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 789. [2020-02-10 20:46:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:46:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3129 transitions. [2020-02-10 20:46:44,038 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3129 transitions. Word has length 25 [2020-02-10 20:46:44,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:44,038 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3129 transitions. [2020-02-10 20:46:44,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3129 transitions. [2020-02-10 20:46:44,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:44,039 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:44,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-02-10 20:46:44,039 INFO L427 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-02-10 20:46:44,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:44,040 INFO L82 PathProgramCache]: Analyzing trace with hash 589867729, now seen corresponding path program 623 times [2020-02-10 20:46:44,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:44,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054147660] [2020-02-10 20:46:44,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:44,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054147660] [2020-02-10 20:46:44,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:44,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:44,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981256150] [2020-02-10 20:46:44,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:44,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:44,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:44,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:44,450 INFO L87 Difference]: Start difference. First operand 789 states and 3129 transitions. Second operand 10 states. [2020-02-10 20:46:44,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:44,599 INFO L93 Difference]: Finished difference Result 1425 states and 4967 transitions. [2020-02-10 20:46:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:44,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:44,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:44,603 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 20:46:44,604 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 20:46:44,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 20:46:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 794. [2020-02-10 20:46:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:46:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3138 transitions. [2020-02-10 20:46:44,629 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3138 transitions. Word has length 25 [2020-02-10 20:46:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:44,630 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3138 transitions. [2020-02-10 20:46:44,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3138 transitions. [2020-02-10 20:46:44,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:44,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:44,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-02-10 20:46:44,631 INFO L427 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-02-10 20:46:44,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:44,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2094158609, now seen corresponding path program 624 times [2020-02-10 20:46:44,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:44,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280460284] [2020-02-10 20:46:44,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:45,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280460284] [2020-02-10 20:46:45,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:45,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:45,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694855714] [2020-02-10 20:46:45,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:45,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:45,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:45,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:45,019 INFO L87 Difference]: Start difference. First operand 794 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:46:45,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:45,163 INFO L93 Difference]: Finished difference Result 1423 states and 4958 transitions. [2020-02-10 20:46:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:45,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:45,167 INFO L225 Difference]: With dead ends: 1423 [2020-02-10 20:46:45,167 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:46:45,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:46:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 783. [2020-02-10 20:46:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:46:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-02-10 20:46:45,191 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-02-10 20:46:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:45,191 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-02-10 20:46:45,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-02-10 20:46:45,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:45,192 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:45,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-02-10 20:46:45,192 INFO L427 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-02-10 20:46:45,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:45,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1864116565, now seen corresponding path program 625 times [2020-02-10 20:46:45,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:45,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903942771] [2020-02-10 20:46:45,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:45,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903942771] [2020-02-10 20:46:45,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:45,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:45,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349653640] [2020-02-10 20:46:45,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:45,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:45,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:45,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:45,591 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:46:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:45,754 INFO L93 Difference]: Finished difference Result 1442 states and 5020 transitions. [2020-02-10 20:46:45,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:45,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:45,758 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 20:46:45,758 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 20:46:45,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 20:46:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 795. [2020-02-10 20:46:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:46:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-02-10 20:46:45,784 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-02-10 20:46:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:45,784 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-02-10 20:46:45,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-02-10 20:46:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:45,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:45,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-02-10 20:46:45,785 INFO L427 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-02-10 20:46:45,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:45,785 INFO L82 PathProgramCache]: Analyzing trace with hash -819909773, now seen corresponding path program 626 times [2020-02-10 20:46:45,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:45,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263728275] [2020-02-10 20:46:45,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:46,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263728275] [2020-02-10 20:46:46,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:46,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:46,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483261242] [2020-02-10 20:46:46,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:46,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:46,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:46,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:46,183 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:46:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:46,347 INFO L93 Difference]: Finished difference Result 1439 states and 5011 transitions. [2020-02-10 20:46:46,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:46,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:46,351 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 20:46:46,351 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:46:46,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-02-10 20:46:46,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:46:46,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 792. [2020-02-10 20:46:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:46:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-02-10 20:46:46,375 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-02-10 20:46:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:46,376 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-02-10 20:46:46,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-02-10 20:46:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:46,377 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:46,377 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:46,377 INFO L427 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-02-10 20:46:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:46,377 INFO L82 PathProgramCache]: Analyzing trace with hash 263678711, now seen corresponding path program 627 times [2020-02-10 20:46:46,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:46,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118625133] [2020-02-10 20:46:46,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:46,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118625133] [2020-02-10 20:46:46,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:46,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:46,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181728078] [2020-02-10 20:46:46,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:46,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:46,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:46,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:46,770 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:46:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:46,920 INFO L93 Difference]: Finished difference Result 1449 states and 5034 transitions. [2020-02-10 20:46:46,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:46,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:46,924 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:46:46,925 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 20:46:46,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-02-10 20:46:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 20:46:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 798. [2020-02-10 20:46:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:46:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3158 transitions. [2020-02-10 20:46:46,949 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3158 transitions. Word has length 25 [2020-02-10 20:46:46,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:46,949 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3158 transitions. [2020-02-10 20:46:46,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3158 transitions. [2020-02-10 20:46:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:46,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:46,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-02-10 20:46:46,951 INFO L427 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-02-10 20:46:46,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:46,951 INFO L82 PathProgramCache]: Analyzing trace with hash -809406669, now seen corresponding path program 628 times [2020-02-10 20:46:46,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:46,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888725098] [2020-02-10 20:46:46,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:47,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888725098] [2020-02-10 20:46:47,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:47,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:47,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564830280] [2020-02-10 20:46:47,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:47,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:47,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:47,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:47,401 INFO L87 Difference]: Start difference. First operand 798 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:46:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:47,572 INFO L93 Difference]: Finished difference Result 1450 states and 5030 transitions. [2020-02-10 20:46:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:47,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:47,576 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 20:46:47,576 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:46:47,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:47,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:46:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 792. [2020-02-10 20:46:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:46:47,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3144 transitions. [2020-02-10 20:46:47,600 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3144 transitions. Word has length 25 [2020-02-10 20:46:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:47,601 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3144 transitions. [2020-02-10 20:46:47,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3144 transitions. [2020-02-10 20:46:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:47,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:47,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-02-10 20:46:47,602 INFO L427 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-02-10 20:46:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:47,602 INFO L82 PathProgramCache]: Analyzing trace with hash 274181815, now seen corresponding path program 629 times [2020-02-10 20:46:47,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:47,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279240887] [2020-02-10 20:46:47,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:48,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279240887] [2020-02-10 20:46:48,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:48,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:48,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519441106] [2020-02-10 20:46:48,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:48,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:48,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:48,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:48,023 INFO L87 Difference]: Start difference. First operand 792 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:46:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:48,183 INFO L93 Difference]: Finished difference Result 1440 states and 5010 transitions. [2020-02-10 20:46:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:48,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:48,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:48,188 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:46:48,188 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:46:48,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:46:48,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 795. [2020-02-10 20:46:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:46:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3149 transitions. [2020-02-10 20:46:48,213 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3149 transitions. Word has length 25 [2020-02-10 20:46:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:48,213 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3149 transitions. [2020-02-10 20:46:48,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3149 transitions. [2020-02-10 20:46:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:48,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46: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-02-10 20:46:48,214 INFO L427 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-02-10 20:46:48,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:48,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1885122773, now seen corresponding path program 630 times [2020-02-10 20:46:48,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:48,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681276177] [2020-02-10 20:46:48,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:48,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681276177] [2020-02-10 20:46:48,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:48,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:48,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669297711] [2020-02-10 20:46:48,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:48,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:48,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:48,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:48,614 INFO L87 Difference]: Start difference. First operand 795 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:46:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:48,758 INFO L93 Difference]: Finished difference Result 1444 states and 5015 transitions. [2020-02-10 20:46:48,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:48,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:48,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:48,762 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 20:46:48,762 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 20:46:48,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:48,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 20:46:48,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 789. [2020-02-10 20:46:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:46:48,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3136 transitions. [2020-02-10 20:46:48,787 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3136 transitions. Word has length 25 [2020-02-10 20:46:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:48,787 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3136 transitions. [2020-02-10 20:46:48,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3136 transitions. [2020-02-10 20:46:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:48,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:48,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:48,788 INFO L427 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-02-10 20:46:48,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:48,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1421217425, now seen corresponding path program 631 times [2020-02-10 20:46:48,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:48,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122127274] [2020-02-10 20:46:48,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:49,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122127274] [2020-02-10 20:46:49,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:49,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:49,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362903989] [2020-02-10 20:46:49,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:49,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:49,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:49,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:49,191 INFO L87 Difference]: Start difference. First operand 789 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:46:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:49,355 INFO L93 Difference]: Finished difference Result 1447 states and 5027 transitions. [2020-02-10 20:46:49,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:49,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:49,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:49,359 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:46:49,359 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:46:49,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:46:49,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 796. [2020-02-10 20:46:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:46:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3155 transitions. [2020-02-10 20:46:49,383 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3155 transitions. Word has length 25 [2020-02-10 20:46:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:49,383 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3155 transitions. [2020-02-10 20:46:49,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3155 transitions. [2020-02-10 20:46:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:49,384 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:49,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-02-10 20:46:49,384 INFO L427 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-02-10 20:46:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:49,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1262808913, now seen corresponding path program 632 times [2020-02-10 20:46:49,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:49,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606066834] [2020-02-10 20:46:49,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:49,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606066834] [2020-02-10 20:46:49,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:49,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:49,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144947443] [2020-02-10 20:46:49,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:49,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:49,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:49,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:49,791 INFO L87 Difference]: Start difference. First operand 796 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:46:49,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:49,943 INFO L93 Difference]: Finished difference Result 1444 states and 5018 transitions. [2020-02-10 20:46:49,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:49,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:49,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:49,948 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 20:46:49,948 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 20:46:49,948 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:49,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 20:46:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 793. [2020-02-10 20:46:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:46:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3147 transitions. [2020-02-10 20:46:49,972 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3147 transitions. Word has length 25 [2020-02-10 20:46:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:49,972 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3147 transitions. [2020-02-10 20:46:49,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3147 transitions. [2020-02-10 20:46:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:49,973 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:49,973 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:49,973 INFO L427 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-02-10 20:46:49,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:49,974 INFO L82 PathProgramCache]: Analyzing trace with hash 914871159, now seen corresponding path program 633 times [2020-02-10 20:46:49,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:49,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962318034] [2020-02-10 20:46:49,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:50,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962318034] [2020-02-10 20:46:50,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:50,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:50,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164494331] [2020-02-10 20:46:50,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:50,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:50,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:50,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:50,378 INFO L87 Difference]: Start difference. First operand 793 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:46:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:50,537 INFO L93 Difference]: Finished difference Result 1457 states and 5046 transitions. [2020-02-10 20:46:50,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:50,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:50,541 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:46:50,541 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 20:46:50,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-02-10 20:46:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 20:46:50,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 800. [2020-02-10 20:46:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:46:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3160 transitions. [2020-02-10 20:46:50,565 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3160 transitions. Word has length 25 [2020-02-10 20:46:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:50,565 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3160 transitions. [2020-02-10 20:46:50,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:50,565 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3160 transitions. [2020-02-10 20:46:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:50,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:50,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:50,567 INFO L427 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-02-10 20:46:50,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:50,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1231299601, now seen corresponding path program 634 times [2020-02-10 20:46:50,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:50,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412797813] [2020-02-10 20:46:50,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:50,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412797813] [2020-02-10 20:46:50,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:50,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:50,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952924075] [2020-02-10 20:46:50,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:50,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:50,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:50,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:50,983 INFO L87 Difference]: Start difference. First operand 800 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:46:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:51,100 INFO L93 Difference]: Finished difference Result 1460 states and 5045 transitions. [2020-02-10 20:46:51,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:51,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:51,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:51,104 INFO L225 Difference]: With dead ends: 1460 [2020-02-10 20:46:51,104 INFO L226 Difference]: Without dead ends: 1435 [2020-02-10 20:46:51,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-02-10 20:46:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 793. [2020-02-10 20:46:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:46:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3143 transitions. [2020-02-10 20:46:51,128 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3143 transitions. Word has length 25 [2020-02-10 20:46:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:51,129 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3143 transitions. [2020-02-10 20:46:51,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3143 transitions. [2020-02-10 20:46:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:51,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:51,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:51,130 INFO L427 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-02-10 20:46:51,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash 925374263, now seen corresponding path program 635 times [2020-02-10 20:46:51,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:51,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249810347] [2020-02-10 20:46:51,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:51,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249810347] [2020-02-10 20:46:51,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:51,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:51,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671423639] [2020-02-10 20:46:51,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:51,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:51,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:51,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:51,553 INFO L87 Difference]: Start difference. First operand 793 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:46:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:51,713 INFO L93 Difference]: Finished difference Result 1448 states and 5021 transitions. [2020-02-10 20:46:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:51,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:51,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:51,716 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 20:46:51,716 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:46:51,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:51,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:46:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 797. [2020-02-10 20:46:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:46:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3150 transitions. [2020-02-10 20:46:51,742 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3150 transitions. Word has length 25 [2020-02-10 20:46:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:51,742 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3150 transitions. [2020-02-10 20:46:51,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3150 transitions. [2020-02-10 20:46:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:51,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:51,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-02-10 20:46:51,744 INFO L427 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-02-10 20:46:51,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:51,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1463229841, now seen corresponding path program 636 times [2020-02-10 20:46:51,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:51,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504598674] [2020-02-10 20:46:51,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:52,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504598674] [2020-02-10 20:46:52,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:52,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:52,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049257966] [2020-02-10 20:46:52,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:52,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:52,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:52,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:52,160 INFO L87 Difference]: Start difference. First operand 797 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:46:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:52,276 INFO L93 Difference]: Finished difference Result 1454 states and 5029 transitions. [2020-02-10 20:46:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:52,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:52,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:52,280 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 20:46:52,280 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:46:52,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:46:52,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 789. [2020-02-10 20:46:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:46:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3132 transitions. [2020-02-10 20:46:52,304 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3132 transitions. Word has length 25 [2020-02-10 20:46:52,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:52,304 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3132 transitions. [2020-02-10 20:46:52,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3132 transitions. [2020-02-10 20:46:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:52,306 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:52,306 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:52,306 INFO L427 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-02-10 20:46:52,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:52,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1746813649, now seen corresponding path program 637 times [2020-02-10 20:46:52,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:52,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782431069] [2020-02-10 20:46:52,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:52,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782431069] [2020-02-10 20:46:52,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:52,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:52,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957473658] [2020-02-10 20:46:52,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:52,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:52,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:52,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:52,721 INFO L87 Difference]: Start difference. First operand 789 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:46:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:52,880 INFO L93 Difference]: Finished difference Result 1471 states and 5085 transitions. [2020-02-10 20:46:52,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:52,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:52,884 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 20:46:52,884 INFO L226 Difference]: Without dead ends: 1456 [2020-02-10 20:46:52,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-02-10 20:46:52,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-02-10 20:46:52,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 804. [2020-02-10 20:46:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:46:52,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3172 transitions. [2020-02-10 20:46:52,908 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3172 transitions. Word has length 25 [2020-02-10 20:46:52,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:52,909 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3172 transitions. [2020-02-10 20:46:52,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:52,909 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3172 transitions. [2020-02-10 20:46:52,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:52,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:52,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-02-10 20:46:52,910 INFO L427 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-02-10 20:46:52,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:52,910 INFO L82 PathProgramCache]: Analyzing trace with hash 673728269, now seen corresponding path program 638 times [2020-02-10 20:46:52,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:52,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244860441] [2020-02-10 20:46:52,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:53,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244860441] [2020-02-10 20:46:53,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:53,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:53,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823241391] [2020-02-10 20:46:53,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:53,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:53,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:53,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:53,320 INFO L87 Difference]: Start difference. First operand 804 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:46:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:53,476 INFO L93 Difference]: Finished difference Result 1472 states and 5081 transitions. [2020-02-10 20:46:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:53,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:53,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:53,480 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 20:46:53,480 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 20:46:53,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 20:46:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 798. [2020-02-10 20:46:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:46:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3155 transitions. [2020-02-10 20:46:53,504 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3155 transitions. Word has length 25 [2020-02-10 20:46:53,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:53,504 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3155 transitions. [2020-02-10 20:46:53,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3155 transitions. [2020-02-10 20:46:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:53,506 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:53,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-02-10 20:46:53,506 INFO L427 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-02-10 20:46:53,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:53,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1454062059, now seen corresponding path program 639 times [2020-02-10 20:46:53,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:53,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994341205] [2020-02-10 20:46:53,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:53,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:53,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994341205] [2020-02-10 20:46:53,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:53,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:53,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829728289] [2020-02-10 20:46:53,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:53,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:53,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:53,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:53,921 INFO L87 Difference]: Start difference. First operand 798 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:46:54,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:54,059 INFO L93 Difference]: Finished difference Result 1474 states and 5084 transitions. [2020-02-10 20:46:54,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:54,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:54,063 INFO L225 Difference]: With dead ends: 1474 [2020-02-10 20:46:54,063 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 20:46:54,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-02-10 20:46:54,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 20:46:54,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 805. [2020-02-10 20:46:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 20:46:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3168 transitions. [2020-02-10 20:46:54,088 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3168 transitions. Word has length 25 [2020-02-10 20:46:54,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:54,088 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3168 transitions. [2020-02-10 20:46:54,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3168 transitions. [2020-02-10 20:46:54,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:54,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:54,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-02-10 20:46:54,089 INFO L427 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-02-10 20:46:54,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:54,089 INFO L82 PathProgramCache]: Analyzing trace with hash 694734477, now seen corresponding path program 640 times [2020-02-10 20:46:54,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:54,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591140400] [2020-02-10 20:46:54,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:54,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591140400] [2020-02-10 20:46:54,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:54,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:54,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106290015] [2020-02-10 20:46:54,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:54,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:54,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:54,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:54,507 INFO L87 Difference]: Start difference. First operand 805 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:46:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:54,636 INFO L93 Difference]: Finished difference Result 1477 states and 5083 transitions. [2020-02-10 20:46:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:54,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:54,640 INFO L225 Difference]: With dead ends: 1477 [2020-02-10 20:46:54,641 INFO L226 Difference]: Without dead ends: 1452 [2020-02-10 20:46:54,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-02-10 20:46:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-02-10 20:46:54,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 798. [2020-02-10 20:46:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:46:54,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3148 transitions. [2020-02-10 20:46:54,666 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3148 transitions. Word has length 25 [2020-02-10 20:46:54,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:54,666 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3148 transitions. [2020-02-10 20:46:54,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:54,666 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3148 transitions. [2020-02-10 20:46:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:54,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:54,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-02-10 20:46:54,667 INFO L427 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-02-10 20:46:54,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:54,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1433055851, now seen corresponding path program 641 times [2020-02-10 20:46:54,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:54,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706786475] [2020-02-10 20:46:54,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:55,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-02-10 20:46:55,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706786475] [2020-02-10 20:46:55,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:55,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:55,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402978561] [2020-02-10 20:46:55,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:55,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:55,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:55,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:55,087 INFO L87 Difference]: Start difference. First operand 798 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:46:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:55,267 INFO L93 Difference]: Finished difference Result 1478 states and 5085 transitions. [2020-02-10 20:46:55,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:55,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:55,271 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 20:46:55,271 INFO L226 Difference]: Without dead ends: 1462 [2020-02-10 20:46:55,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-02-10 20:46:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-02-10 20:46:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 807. [2020-02-10 20:46:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:46:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3164 transitions. [2020-02-10 20:46:55,296 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3164 transitions. Word has length 25 [2020-02-10 20:46:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:55,296 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3164 transitions. [2020-02-10 20:46:55,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3164 transitions. [2020-02-10 20:46:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:55,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:55,297 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:55,297 INFO L427 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-02-10 20:46:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:55,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1788826065, now seen corresponding path program 642 times [2020-02-10 20:46:55,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:55,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706084618] [2020-02-10 20:46:55,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:55,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706084618] [2020-02-10 20:46:55,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:55,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:55,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000717543] [2020-02-10 20:46:55,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:55,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:55,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:55,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:55,730 INFO L87 Difference]: Start difference. First operand 807 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:46:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:55,868 INFO L93 Difference]: Finished difference Result 1480 states and 5081 transitions. [2020-02-10 20:46:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:55,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:55,872 INFO L225 Difference]: With dead ends: 1480 [2020-02-10 20:46:55,873 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:46:55,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:46:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 789. [2020-02-10 20:46:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:46:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3126 transitions. [2020-02-10 20:46:55,897 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3126 transitions. Word has length 25 [2020-02-10 20:46:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:55,897 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3126 transitions. [2020-02-10 20:46:55,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3126 transitions. [2020-02-10 20:46:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:55,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:55,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-02-10 20:46:55,898 INFO L427 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-02-10 20:46:55,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:55,898 INFO L82 PathProgramCache]: Analyzing trace with hash -611616465, now seen corresponding path program 643 times [2020-02-10 20:46:55,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:55,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447178243] [2020-02-10 20:46:55,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:56,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447178243] [2020-02-10 20:46:56,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:56,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:56,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975946133] [2020-02-10 20:46:56,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:56,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:56,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:56,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:56,299 INFO L87 Difference]: Start difference. First operand 789 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:46:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:56,459 INFO L93 Difference]: Finished difference Result 1449 states and 5021 transitions. [2020-02-10 20:46:56,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:56,459 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:56,463 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:46:56,463 INFO L226 Difference]: Without dead ends: 1437 [2020-02-10 20:46:56,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-02-10 20:46:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 797. [2020-02-10 20:46:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:46:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3147 transitions. [2020-02-10 20:46:56,487 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3147 transitions. Word has length 25 [2020-02-10 20:46:56,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:56,487 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3147 transitions. [2020-02-10 20:46:56,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:56,487 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3147 transitions. [2020-02-10 20:46:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:56,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:56,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-02-10 20:46:56,489 INFO L427 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-02-10 20:46:56,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:56,489 INFO L82 PathProgramCache]: Analyzing trace with hash 999324493, now seen corresponding path program 644 times [2020-02-10 20:46:56,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:56,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717582773] [2020-02-10 20:46:56,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:56,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717582773] [2020-02-10 20:46:56,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:56,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:56,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629041983] [2020-02-10 20:46:56,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:56,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:56,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:56,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:56,899 INFO L87 Difference]: Start difference. First operand 797 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:46:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:57,044 INFO L93 Difference]: Finished difference Result 1453 states and 5026 transitions. [2020-02-10 20:46:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:57,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:57,048 INFO L225 Difference]: With dead ends: 1453 [2020-02-10 20:46:57,048 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 20:46:57,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-02-10 20:46:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 20:46:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 794. [2020-02-10 20:46:57,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:46:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3139 transitions. [2020-02-10 20:46:57,073 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3139 transitions. Word has length 25 [2020-02-10 20:46:57,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:57,073 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3139 transitions. [2020-02-10 20:46:57,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3139 transitions. [2020-02-10 20:46:57,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:57,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:57,074 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:57,074 INFO L427 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-02-10 20:46:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash 482475123, now seen corresponding path program 645 times [2020-02-10 20:46:57,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:57,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075535011] [2020-02-10 20:46:57,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:57,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-02-10 20:46:57,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075535011] [2020-02-10 20:46:57,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:57,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:57,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318530618] [2020-02-10 20:46:57,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:57,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:57,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:57,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:57,479 INFO L87 Difference]: Start difference. First operand 794 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:46:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:57,614 INFO L93 Difference]: Finished difference Result 1452 states and 5023 transitions. [2020-02-10 20:46:57,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:57,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:57,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:57,618 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 20:46:57,619 INFO L226 Difference]: Without dead ends: 1440 [2020-02-10 20:46:57,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-02-10 20:46:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-02-10 20:46:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 798. [2020-02-10 20:46:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:46:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3146 transitions. [2020-02-10 20:46:57,643 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3146 transitions. Word has length 25 [2020-02-10 20:46:57,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:57,644 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3146 transitions. [2020-02-10 20:46:57,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:57,644 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3146 transitions. [2020-02-10 20:46:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:57,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:57,645 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:57,645 INFO L427 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-02-10 20:46:57,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:57,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1020330701, now seen corresponding path program 646 times [2020-02-10 20:46:57,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:57,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911178763] [2020-02-10 20:46:57,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46: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-02-10 20:46:58,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911178763] [2020-02-10 20:46:58,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:58,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:58,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972594927] [2020-02-10 20:46:58,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:58,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:58,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:58,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:58,055 INFO L87 Difference]: Start difference. First operand 798 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:46:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:58,188 INFO L93 Difference]: Finished difference Result 1458 states and 5031 transitions. [2020-02-10 20:46:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:58,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:58,193 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 20:46:58,193 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:46:58,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-02-10 20:46:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:46:58,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 794. [2020-02-10 20:46:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:46:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3135 transitions. [2020-02-10 20:46:58,217 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3135 transitions. Word has length 25 [2020-02-10 20:46:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:58,217 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3135 transitions. [2020-02-10 20:46:58,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3135 transitions. [2020-02-10 20:46:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:58,218 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:58,218 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:58,218 INFO L427 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-02-10 20:46:58,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:58,219 INFO L82 PathProgramCache]: Analyzing trace with hash 492978227, now seen corresponding path program 647 times [2020-02-10 20:46:58,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:58,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665975729] [2020-02-10 20:46:58,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:58,644 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-02-10 20:46:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:58,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665975729] [2020-02-10 20:46:58,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:58,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:58,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780889669] [2020-02-10 20:46:58,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:58,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:58,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:58,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:58,650 INFO L87 Difference]: Start difference. First operand 794 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:46:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:58,804 INFO L93 Difference]: Finished difference Result 1465 states and 5048 transitions. [2020-02-10 20:46:58,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:58,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:58,808 INFO L225 Difference]: With dead ends: 1465 [2020-02-10 20:46:58,809 INFO L226 Difference]: Without dead ends: 1449 [2020-02-10 20:46:58,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-02-10 20:46:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 803. [2020-02-10 20:46:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:46:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3151 transitions. [2020-02-10 20:46:58,833 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3151 transitions. Word has length 25 [2020-02-10 20:46:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:58,833 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3151 transitions. [2020-02-10 20:46:58,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3151 transitions. [2020-02-10 20:46:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:58,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:58,834 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:46:58,834 INFO L427 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-02-10 20:46:58,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:58,835 INFO L82 PathProgramCache]: Analyzing trace with hash -580107153, now seen corresponding path program 648 times [2020-02-10 20:46:58,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:58,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489453630] [2020-02-10 20:46:58,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:59,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489453630] [2020-02-10 20:46:59,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:59,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:59,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968996967] [2020-02-10 20:46:59,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:59,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:59,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:59,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:59,257 INFO L87 Difference]: Start difference. First operand 803 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:46:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:59,363 INFO L93 Difference]: Finished difference Result 1467 states and 5044 transitions. [2020-02-10 20:46:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:59,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:59,367 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 20:46:59,367 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 20:46:59,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-02-10 20:46:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 20:46:59,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 783. [2020-02-10 20:46:59,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:46:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3110 transitions. [2020-02-10 20:46:59,391 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3110 transitions. Word has length 25 [2020-02-10 20:46:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:46:59,391 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3110 transitions. [2020-02-10 20:46:59,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:46:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3110 transitions. [2020-02-10 20:46:59,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:46:59,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:46:59,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-02-10 20:46:59,393 INFO L427 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-02-10 20:46:59,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:46:59,393 INFO L82 PathProgramCache]: Analyzing trace with hash -927302379, now seen corresponding path program 649 times [2020-02-10 20:46:59,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:46:59,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925078483] [2020-02-10 20:46:59,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:46:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:46:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:46:59,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925078483] [2020-02-10 20:46:59,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:46:59,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:46:59,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442954575] [2020-02-10 20:46:59,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:46:59,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:46:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:46:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:46:59,785 INFO L87 Difference]: Start difference. First operand 783 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:46:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:46:59,977 INFO L93 Difference]: Finished difference Result 1427 states and 4979 transitions. [2020-02-10 20:46:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:46:59,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:46:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:46:59,981 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 20:46:59,981 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:46:59,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:46:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:47:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 793. [2020-02-10 20:47:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:47:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3144 transitions. [2020-02-10 20:47:00,005 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3144 transitions. Word has length 25 [2020-02-10 20:47:00,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:00,005 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3144 transitions. [2020-02-10 20:47:00,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3144 transitions. [2020-02-10 20:47:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:00,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:00,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-02-10 20:47:00,006 INFO L427 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-02-10 20:47:00,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:00,006 INFO L82 PathProgramCache]: Analyzing trace with hash 683638579, now seen corresponding path program 650 times [2020-02-10 20:47:00,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:00,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694812782] [2020-02-10 20:47:00,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:00,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694812782] [2020-02-10 20:47:00,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:00,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:00,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001514331] [2020-02-10 20:47:00,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:00,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:00,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:00,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:00,400 INFO L87 Difference]: Start difference. First operand 793 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:47:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:00,589 INFO L93 Difference]: Finished difference Result 1424 states and 4970 transitions. [2020-02-10 20:47:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:00,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:00,593 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 20:47:00,594 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 20:47:00,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-02-10 20:47:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 20:47:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 790. [2020-02-10 20:47:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:47:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3136 transitions. [2020-02-10 20:47:00,618 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3136 transitions. Word has length 25 [2020-02-10 20:47:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:00,618 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3136 transitions. [2020-02-10 20:47:00,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3136 transitions. [2020-02-10 20:47:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:00,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:00,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-02-10 20:47:00,619 INFO L427 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-02-10 20:47:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:00,619 INFO L82 PathProgramCache]: Analyzing trace with hash 166789209, now seen corresponding path program 651 times [2020-02-10 20:47:00,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:00,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412566165] [2020-02-10 20:47:00,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:01,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412566165] [2020-02-10 20:47:01,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:01,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:01,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407134210] [2020-02-10 20:47:01,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:01,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:01,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:01,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:01,020 INFO L87 Difference]: Start difference. First operand 790 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:47:01,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:01,169 INFO L93 Difference]: Finished difference Result 1431 states and 4986 transitions. [2020-02-10 20:47:01,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:01,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:01,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:01,173 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 20:47:01,174 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:47:01,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:47:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-02-10 20:47:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:47:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-02-10 20:47:01,198 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-02-10 20:47:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:01,198 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-02-10 20:47:01,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-02-10 20:47:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:01,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:01,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-02-10 20:47:01,200 INFO L427 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-02-10 20:47:01,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:01,200 INFO L82 PathProgramCache]: Analyzing trace with hash 704644787, now seen corresponding path program 652 times [2020-02-10 20:47:01,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:01,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069767190] [2020-02-10 20:47:01,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:01,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069767190] [2020-02-10 20:47:01,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:01,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:01,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47433154] [2020-02-10 20:47:01,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:01,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:01,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:01,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:01,595 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:47:01,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:01,787 INFO L93 Difference]: Finished difference Result 1430 states and 4979 transitions. [2020-02-10 20:47:01,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:01,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:01,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:01,790 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 20:47:01,790 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 20:47:01,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-02-10 20:47:01,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 20:47:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 790. [2020-02-10 20:47:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:47:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3133 transitions. [2020-02-10 20:47:01,815 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3133 transitions. Word has length 25 [2020-02-10 20:47:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:01,815 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3133 transitions. [2020-02-10 20:47:01,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3133 transitions. [2020-02-10 20:47:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:01,816 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:01,816 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:01,816 INFO L427 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-02-10 20:47:01,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:01,816 INFO L82 PathProgramCache]: Analyzing trace with hash 177292313, now seen corresponding path program 653 times [2020-02-10 20:47:01,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:01,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111517184] [2020-02-10 20:47:01,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:02,225 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2020-02-10 20:47:02,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-02-10 20:47:02,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111517184] [2020-02-10 20:47:02,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:02,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:02,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410032519] [2020-02-10 20:47:02,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:02,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:02,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:02,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:02,231 INFO L87 Difference]: Start difference. First operand 790 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:47:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:02,419 INFO L93 Difference]: Finished difference Result 1423 states and 4965 transitions. [2020-02-10 20:47:02,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:02,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:02,423 INFO L225 Difference]: With dead ends: 1423 [2020-02-10 20:47:02,423 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 20:47:02,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-02-10 20:47:02,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 20:47:02,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 793. [2020-02-10 20:47:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:47:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3138 transitions. [2020-02-10 20:47:02,450 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3138 transitions. Word has length 25 [2020-02-10 20:47:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:02,450 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3138 transitions. [2020-02-10 20:47:02,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3138 transitions. [2020-02-10 20:47:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:02,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:02,451 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:02,451 INFO L427 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-02-10 20:47:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:02,452 INFO L82 PathProgramCache]: Analyzing trace with hash -895793067, now seen corresponding path program 654 times [2020-02-10 20:47:02,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:02,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302557219] [2020-02-10 20:47:02,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:02,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302557219] [2020-02-10 20:47:02,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:02,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:02,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438479795] [2020-02-10 20:47:02,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:02,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:02,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:02,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:02,839 INFO L87 Difference]: Start difference. First operand 793 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:47:03,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:03,010 INFO L93 Difference]: Finished difference Result 1425 states and 4966 transitions. [2020-02-10 20:47:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:03,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:03,014 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 20:47:03,015 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 20:47:03,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-02-10 20:47:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 20:47:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 787. [2020-02-10 20:47:03,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:47:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3125 transitions. [2020-02-10 20:47:03,040 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3125 transitions. Word has length 25 [2020-02-10 20:47:03,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:03,040 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3125 transitions. [2020-02-10 20:47:03,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3125 transitions. [2020-02-10 20:47:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:03,041 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:03,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-02-10 20:47:03,041 INFO L427 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-02-10 20:47:03,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:03,042 INFO L82 PathProgramCache]: Analyzing trace with hash 998731699, now seen corresponding path program 655 times [2020-02-10 20:47:03,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:03,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12862286] [2020-02-10 20:47:03,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:03,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-02-10 20:47:03,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12862286] [2020-02-10 20:47:03,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:03,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:03,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555854253] [2020-02-10 20:47:03,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:03,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:03,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:03,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:03,445 INFO L87 Difference]: Start difference. First operand 787 states and 3125 transitions. Second operand 10 states. [2020-02-10 20:47:03,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:03,635 INFO L93 Difference]: Finished difference Result 1435 states and 4993 transitions. [2020-02-10 20:47:03,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:03,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:03,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:03,639 INFO L225 Difference]: With dead ends: 1435 [2020-02-10 20:47:03,639 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 20:47:03,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 20:47:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 794. [2020-02-10 20:47:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:47:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3144 transitions. [2020-02-10 20:47:03,663 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3144 transitions. Word has length 25 [2020-02-10 20:47:03,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:03,663 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3144 transitions. [2020-02-10 20:47:03,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3144 transitions. [2020-02-10 20:47:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:03,664 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:03,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-02-10 20:47:03,665 INFO L427 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-02-10 20:47:03,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:03,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1685294639, now seen corresponding path program 656 times [2020-02-10 20:47:03,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:03,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146658491] [2020-02-10 20:47:03,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:04,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146658491] [2020-02-10 20:47:04,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:04,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:04,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976027277] [2020-02-10 20:47:04,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:04,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:04,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:04,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:04,062 INFO L87 Difference]: Start difference. First operand 794 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:47:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:04,214 INFO L93 Difference]: Finished difference Result 1432 states and 4984 transitions. [2020-02-10 20:47:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:04,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:04,218 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:47:04,218 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 20:47:04,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-02-10 20:47:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 20:47:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 791. [2020-02-10 20:47:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:47:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3136 transitions. [2020-02-10 20:47:04,243 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3136 transitions. Word has length 25 [2020-02-10 20:47:04,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:04,243 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3136 transitions. [2020-02-10 20:47:04,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3136 transitions. [2020-02-10 20:47:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:04,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:04,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-02-10 20:47:04,245 INFO L427 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-02-10 20:47:04,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:04,245 INFO L82 PathProgramCache]: Analyzing trace with hash 492385433, now seen corresponding path program 657 times [2020-02-10 20:47:04,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:04,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941032946] [2020-02-10 20:47:04,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:04,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941032946] [2020-02-10 20:47:04,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:04,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:04,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991037739] [2020-02-10 20:47:04,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:04,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:04,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:04,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:04,639 INFO L87 Difference]: Start difference. First operand 791 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:47:04,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:04,810 INFO L93 Difference]: Finished difference Result 1445 states and 5012 transitions. [2020-02-10 20:47:04,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:04,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:04,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:04,814 INFO L225 Difference]: With dead ends: 1445 [2020-02-10 20:47:04,814 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 20:47:04,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 20:47:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 798. [2020-02-10 20:47:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:47:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3149 transitions. [2020-02-10 20:47:04,838 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3149 transitions. Word has length 25 [2020-02-10 20:47:04,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:04,838 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3149 transitions. [2020-02-10 20:47:04,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3149 transitions. [2020-02-10 20:47:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:04,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:04,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:04,839 INFO L427 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-02-10 20:47:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:04,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1653785327, now seen corresponding path program 658 times [2020-02-10 20:47:04,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:04,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581882625] [2020-02-10 20:47:04,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:05,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:05,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581882625] [2020-02-10 20:47:05,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:05,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:05,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771578578] [2020-02-10 20:47:05,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:05,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:05,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:05,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:05,245 INFO L87 Difference]: Start difference. First operand 798 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:47:05,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:05,367 INFO L93 Difference]: Finished difference Result 1448 states and 5011 transitions. [2020-02-10 20:47:05,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:05,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:05,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:05,371 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 20:47:05,371 INFO L226 Difference]: Without dead ends: 1423 [2020-02-10 20:47:05,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:05,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-02-10 20:47:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 791. [2020-02-10 20:47:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:47:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3132 transitions. [2020-02-10 20:47:05,395 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3132 transitions. Word has length 25 [2020-02-10 20:47:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:05,395 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3132 transitions. [2020-02-10 20:47:05,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3132 transitions. [2020-02-10 20:47:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:05,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:05,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:05,396 INFO L427 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-02-10 20:47:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash 502888537, now seen corresponding path program 659 times [2020-02-10 20:47:05,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:05,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214776969] [2020-02-10 20:47:05,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:05,822 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2020-02-10 20:47:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:05,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214776969] [2020-02-10 20:47:05,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:05,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:05,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887415934] [2020-02-10 20:47:05,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:05,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:05,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:05,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:05,828 INFO L87 Difference]: Start difference. First operand 791 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:47:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:05,984 INFO L93 Difference]: Finished difference Result 1436 states and 4987 transitions. [2020-02-10 20:47:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:05,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:05,988 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 20:47:05,989 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:47:05,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:06,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:47:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 795. [2020-02-10 20:47:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:47:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3139 transitions. [2020-02-10 20:47:06,013 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3139 transitions. Word has length 25 [2020-02-10 20:47:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:06,013 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3139 transitions. [2020-02-10 20:47:06,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3139 transitions. [2020-02-10 20:47:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:06,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:06,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:06,015 INFO L427 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-02-10 20:47:06,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:06,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1040744115, now seen corresponding path program 660 times [2020-02-10 20:47:06,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:06,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461479517] [2020-02-10 20:47:06,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:06,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:06,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461479517] [2020-02-10 20:47:06,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:06,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:06,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856443246] [2020-02-10 20:47:06,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:06,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:06,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:06,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:06,426 INFO L87 Difference]: Start difference. First operand 795 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:47:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:06,543 INFO L93 Difference]: Finished difference Result 1442 states and 4995 transitions. [2020-02-10 20:47:06,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:06,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:06,547 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 20:47:06,547 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:47:06,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:47:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 787. [2020-02-10 20:47:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:47:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3121 transitions. [2020-02-10 20:47:06,573 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3121 transitions. Word has length 25 [2020-02-10 20:47:06,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:06,573 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3121 transitions. [2020-02-10 20:47:06,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:06,573 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3121 transitions. [2020-02-10 20:47:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:06,574 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:06,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-02-10 20:47:06,574 INFO L427 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-02-10 20:47:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1649924147, now seen corresponding path program 661 times [2020-02-10 20:47:06,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:06,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817520306] [2020-02-10 20:47:06,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:06,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817520306] [2020-02-10 20:47:06,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:06,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:06,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708573611] [2020-02-10 20:47:06,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:06,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:06,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:06,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:06,983 INFO L87 Difference]: Start difference. First operand 787 states and 3121 transitions. Second operand 10 states. [2020-02-10 20:47:07,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:07,171 INFO L93 Difference]: Finished difference Result 1447 states and 5023 transitions. [2020-02-10 20:47:07,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:07,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:07,175 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:47:07,175 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:47:07,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-02-10 20:47:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:47:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 798. [2020-02-10 20:47:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:47:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3152 transitions. [2020-02-10 20:47:07,200 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3152 transitions. Word has length 25 [2020-02-10 20:47:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:07,200 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3152 transitions. [2020-02-10 20:47:07,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3152 transitions. [2020-02-10 20:47:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:07,201 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:07,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-02-10 20:47:07,201 INFO L427 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-02-10 20:47:07,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:07,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2107187571, now seen corresponding path program 662 times [2020-02-10 20:47:07,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:07,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081764083] [2020-02-10 20:47:07,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:07,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081764083] [2020-02-10 20:47:07,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:07,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:07,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871363848] [2020-02-10 20:47:07,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:07,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:07,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:07,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:07,609 INFO L87 Difference]: Start difference. First operand 798 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:47:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:07,775 INFO L93 Difference]: Finished difference Result 1446 states and 5016 transitions. [2020-02-10 20:47:07,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:07,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:07,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:07,780 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 20:47:07,780 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 20:47:07,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 20:47:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 793. [2020-02-10 20:47:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:47:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3138 transitions. [2020-02-10 20:47:07,804 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3138 transitions. Word has length 25 [2020-02-10 20:47:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:07,804 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3138 transitions. [2020-02-10 20:47:07,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3138 transitions. [2020-02-10 20:47:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:07,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:07,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-02-10 20:47:07,805 INFO L427 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-02-10 20:47:07,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:07,805 INFO L82 PathProgramCache]: Analyzing trace with hash 49486293, now seen corresponding path program 663 times [2020-02-10 20:47:07,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:07,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480140825] [2020-02-10 20:47:07,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:08,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480140825] [2020-02-10 20:47:08,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:08,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:08,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760418675] [2020-02-10 20:47:08,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:08,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:08,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:08,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:08,217 INFO L87 Difference]: Start difference. First operand 793 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:47:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:08,403 INFO L93 Difference]: Finished difference Result 1453 states and 5030 transitions. [2020-02-10 20:47:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:08,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:08,408 INFO L225 Difference]: With dead ends: 1453 [2020-02-10 20:47:08,408 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 20:47:08,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 20:47:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 800. [2020-02-10 20:47:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:47:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3151 transitions. [2020-02-10 20:47:08,432 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3151 transitions. Word has length 25 [2020-02-10 20:47:08,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:08,432 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3151 transitions. [2020-02-10 20:47:08,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3151 transitions. [2020-02-10 20:47:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:08,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:08,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-02-10 20:47:08,434 INFO L427 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-02-10 20:47:08,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:08,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2096684467, now seen corresponding path program 664 times [2020-02-10 20:47:08,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:08,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388187071] [2020-02-10 20:47:08,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:08,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388187071] [2020-02-10 20:47:08,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:08,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:08,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726887943] [2020-02-10 20:47:08,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:08,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:08,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:08,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:08,849 INFO L87 Difference]: Start difference. First operand 800 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:47:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:08,971 INFO L93 Difference]: Finished difference Result 1456 states and 5029 transitions. [2020-02-10 20:47:08,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:08,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:08,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:08,975 INFO L225 Difference]: With dead ends: 1456 [2020-02-10 20:47:08,976 INFO L226 Difference]: Without dead ends: 1431 [2020-02-10 20:47:08,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-02-10 20:47:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 793. [2020-02-10 20:47:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:47:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3132 transitions. [2020-02-10 20:47:09,000 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3132 transitions. Word has length 25 [2020-02-10 20:47:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:09,000 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3132 transitions. [2020-02-10 20:47:09,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3132 transitions. [2020-02-10 20:47:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:09,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:09,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-02-10 20:47:09,002 INFO L427 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-02-10 20:47:09,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:09,002 INFO L82 PathProgramCache]: Analyzing trace with hash 80995605, now seen corresponding path program 665 times [2020-02-10 20:47:09,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:09,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676284701] [2020-02-10 20:47:09,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:09,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676284701] [2020-02-10 20:47:09,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:09,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:09,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312573852] [2020-02-10 20:47:09,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:09,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:09,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:09,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:09,413 INFO L87 Difference]: Start difference. First operand 793 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:47:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:09,592 INFO L93 Difference]: Finished difference Result 1450 states and 5017 transitions. [2020-02-10 20:47:09,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:09,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:09,596 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 20:47:09,597 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:47:09,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:47:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 799. [2020-02-10 20:47:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:47:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3143 transitions. [2020-02-10 20:47:09,621 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3143 transitions. Word has length 25 [2020-02-10 20:47:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:09,621 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3143 transitions. [2020-02-10 20:47:09,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3143 transitions. [2020-02-10 20:47:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:09,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:09,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-02-10 20:47:09,622 INFO L427 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-02-10 20:47:09,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:09,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1691936563, now seen corresponding path program 666 times [2020-02-10 20:47:09,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:09,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250098545] [2020-02-10 20:47:09,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:10,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250098545] [2020-02-10 20:47:10,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:10,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:10,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644759827] [2020-02-10 20:47:10,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:10,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:10,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:10,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:10,029 INFO L87 Difference]: Start difference. First operand 799 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:47:10,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:10,159 INFO L93 Difference]: Finished difference Result 1454 states and 5019 transitions. [2020-02-10 20:47:10,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:10,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:10,163 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 20:47:10,163 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:47:10,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-02-10 20:47:10,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:47:10,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 787. [2020-02-10 20:47:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:47:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3117 transitions. [2020-02-10 20:47:10,187 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3117 transitions. Word has length 25 [2020-02-10 20:47:10,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:10,187 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3117 transitions. [2020-02-10 20:47:10,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3117 transitions. [2020-02-10 20:47:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:10,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:10,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-02-10 20:47:10,188 INFO L427 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-02-10 20:47:10,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:10,188 INFO L82 PathProgramCache]: Analyzing trace with hash -708505967, now seen corresponding path program 667 times [2020-02-10 20:47:10,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:10,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769969139] [2020-02-10 20:47:10,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:10,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769969139] [2020-02-10 20:47:10,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:10,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:10,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757836354] [2020-02-10 20:47:10,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:10,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:10,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:10,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:10,589 INFO L87 Difference]: Start difference. First operand 787 states and 3117 transitions. Second operand 10 states. [2020-02-10 20:47:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:10,737 INFO L93 Difference]: Finished difference Result 1429 states and 4972 transitions. [2020-02-10 20:47:10,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:10,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:10,741 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:47:10,741 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 20:47:10,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-02-10 20:47:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 20:47:10,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 794. [2020-02-10 20:47:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:47:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3136 transitions. [2020-02-10 20:47:10,765 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3136 transitions. Word has length 25 [2020-02-10 20:47:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:10,765 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3136 transitions. [2020-02-10 20:47:10,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3136 transitions. [2020-02-10 20:47:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:10,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:10,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-02-10 20:47:10,766 INFO L427 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-02-10 20:47:10,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:10,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1781591347, now seen corresponding path program 668 times [2020-02-10 20:47:10,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:10,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157899442] [2020-02-10 20:47:10,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:11,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157899442] [2020-02-10 20:47:11,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:11,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:11,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568822809] [2020-02-10 20:47:11,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:11,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:11,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:11,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:11,147 INFO L87 Difference]: Start difference. First operand 794 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:47:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:11,334 INFO L93 Difference]: Finished difference Result 1431 states and 4973 transitions. [2020-02-10 20:47:11,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:11,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:11,338 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 20:47:11,338 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 20:47:11,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-02-10 20:47:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 20:47:11,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 791. [2020-02-10 20:47:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:47:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3128 transitions. [2020-02-10 20:47:11,362 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3128 transitions. Word has length 25 [2020-02-10 20:47:11,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:11,362 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3128 transitions. [2020-02-10 20:47:11,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3128 transitions. [2020-02-10 20:47:11,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:11,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:11,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-02-10 20:47:11,364 INFO L427 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-02-10 20:47:11,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:11,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1986023475, now seen corresponding path program 669 times [2020-02-10 20:47:11,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:11,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821573814] [2020-02-10 20:47:11,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:11,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821573814] [2020-02-10 20:47:11,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:11,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:11,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044658522] [2020-02-10 20:47:11,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:11,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:11,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:11,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:11,744 INFO L87 Difference]: Start difference. First operand 791 states and 3128 transitions. Second operand 10 states. [2020-02-10 20:47:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:11,930 INFO L93 Difference]: Finished difference Result 1434 states and 4978 transitions. [2020-02-10 20:47:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:11,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:11,934 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:47:11,934 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 20:47:11,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-02-10 20:47:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 20:47:11,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 795. [2020-02-10 20:47:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:47:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3135 transitions. [2020-02-10 20:47:11,958 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3135 transitions. Word has length 25 [2020-02-10 20:47:11,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:11,958 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3135 transitions. [2020-02-10 20:47:11,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3135 transitions. [2020-02-10 20:47:11,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:11,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:11,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-02-10 20:47:11,960 INFO L427 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-02-10 20:47:11,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:11,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1771088243, now seen corresponding path program 670 times [2020-02-10 20:47:11,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:11,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861369600] [2020-02-10 20:47:11,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:12,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861369600] [2020-02-10 20:47:12,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:12,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:12,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135865183] [2020-02-10 20:47:12,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:12,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:12,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:12,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:12,356 INFO L87 Difference]: Start difference. First operand 795 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:47:12,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:12,456 INFO L93 Difference]: Finished difference Result 1440 states and 4986 transitions. [2020-02-10 20:47:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:12,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:12,460 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:47:12,460 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:47:12,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:47:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 791. [2020-02-10 20:47:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:47:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3124 transitions. [2020-02-10 20:47:12,485 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3124 transitions. Word has length 25 [2020-02-10 20:47:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:12,485 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3124 transitions. [2020-02-10 20:47:12,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3124 transitions. [2020-02-10 20:47:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:12,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:12,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-02-10 20:47:12,486 INFO L427 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-02-10 20:47:12,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:12,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2007029683, now seen corresponding path program 671 times [2020-02-10 20:47:12,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:12,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318759153] [2020-02-10 20:47:12,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:12,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318759153] [2020-02-10 20:47:12,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:12,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:12,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187858841] [2020-02-10 20:47:12,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:12,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:12,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:12,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:12,878 INFO L87 Difference]: Start difference. First operand 791 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:47:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:13,035 INFO L93 Difference]: Finished difference Result 1440 states and 4988 transitions. [2020-02-10 20:47:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:13,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:13,040 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:47:13,040 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 20:47:13,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:13,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 20:47:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 797. [2020-02-10 20:47:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:47:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3135 transitions. [2020-02-10 20:47:13,065 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3135 transitions. Word has length 25 [2020-02-10 20:47:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:13,065 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3135 transitions. [2020-02-10 20:47:13,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3135 transitions. [2020-02-10 20:47:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:13,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:13,066 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:13,066 INFO L427 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-02-10 20:47:13,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:13,067 INFO L82 PathProgramCache]: Analyzing trace with hash -676996655, now seen corresponding path program 672 times [2020-02-10 20:47:13,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:13,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873513061] [2020-02-10 20:47:13,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:13,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873513061] [2020-02-10 20:47:13,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:13,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:13,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129160600] [2020-02-10 20:47:13,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:13,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:13,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:13,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:13,491 INFO L87 Difference]: Start difference. First operand 797 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:47:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:13,592 INFO L93 Difference]: Finished difference Result 1444 states and 4990 transitions. [2020-02-10 20:47:13,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:13,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:13,596 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 20:47:13,596 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:47:13,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-02-10 20:47:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:47:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 783. [2020-02-10 20:47:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:47:13,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3106 transitions. [2020-02-10 20:47:13,620 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3106 transitions. Word has length 25 [2020-02-10 20:47:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:13,620 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3106 transitions. [2020-02-10 20:47:13,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3106 transitions. [2020-02-10 20:47:13,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:13,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:13,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-02-10 20:47:13,622 INFO L427 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-02-10 20:47:13,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:13,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1024191881, now seen corresponding path program 673 times [2020-02-10 20:47:13,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:13,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639879726] [2020-02-10 20:47:13,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47: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-02-10 20:47:14,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639879726] [2020-02-10 20:47:14,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:14,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:14,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951158386] [2020-02-10 20:47:14,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:14,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:14,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:14,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:14,028 INFO L87 Difference]: Start difference. First operand 783 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:47:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:14,159 INFO L93 Difference]: Finished difference Result 1474 states and 5108 transitions. [2020-02-10 20:47:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:14,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:14,163 INFO L225 Difference]: With dead ends: 1474 [2020-02-10 20:47:14,163 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 20:47:14,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:14,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 20:47:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 803. [2020-02-10 20:47:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:47:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3170 transitions. [2020-02-10 20:47:14,188 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3170 transitions. Word has length 25 [2020-02-10 20:47:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:14,188 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3170 transitions. [2020-02-10 20:47:14,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3170 transitions. [2020-02-10 20:47:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:14,189 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:14,189 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:14,189 INFO L427 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-02-10 20:47:14,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2097277261, now seen corresponding path program 674 times [2020-02-10 20:47:14,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:14,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887687699] [2020-02-10 20:47:14,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:14,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887687699] [2020-02-10 20:47:14,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:14,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:14,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724393413] [2020-02-10 20:47:14,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:14,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:14,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:14,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:14,607 INFO L87 Difference]: Start difference. First operand 803 states and 3170 transitions. Second operand 10 states. [2020-02-10 20:47:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:14,736 INFO L93 Difference]: Finished difference Result 1475 states and 5104 transitions. [2020-02-10 20:47:14,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:14,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:14,740 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 20:47:14,740 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 20:47:14,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-02-10 20:47:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 20:47:14,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 797. [2020-02-10 20:47:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:47:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3154 transitions. [2020-02-10 20:47:14,765 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3154 transitions. Word has length 25 [2020-02-10 20:47:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:14,765 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3154 transitions. [2020-02-10 20:47:14,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3154 transitions. [2020-02-10 20:47:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:14,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:14,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-02-10 20:47:14,766 INFO L427 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-02-10 20:47:14,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:14,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1670337561, now seen corresponding path program 675 times [2020-02-10 20:47:14,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:14,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744928209] [2020-02-10 20:47:14,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:15,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744928209] [2020-02-10 20:47:15,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:15,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:15,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780945512] [2020-02-10 20:47:15,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:15,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:15,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:15,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:15,174 INFO L87 Difference]: Start difference. First operand 797 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:47:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:15,320 INFO L93 Difference]: Finished difference Result 1471 states and 5096 transitions. [2020-02-10 20:47:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:15,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:15,324 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 20:47:15,324 INFO L226 Difference]: Without dead ends: 1456 [2020-02-10 20:47:15,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-02-10 20:47:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 802. [2020-02-10 20:47:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:47:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3163 transitions. [2020-02-10 20:47:15,348 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3163 transitions. Word has length 25 [2020-02-10 20:47:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:15,348 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3163 transitions. [2020-02-10 20:47:15,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3163 transitions. [2020-02-10 20:47:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:15,349 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:15,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-02-10 20:47:15,349 INFO L427 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-02-10 20:47:15,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash -2086774157, now seen corresponding path program 676 times [2020-02-10 20:47:15,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:15,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753270518] [2020-02-10 20:47:15,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:15,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753270518] [2020-02-10 20:47:15,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:15,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:15,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648930242] [2020-02-10 20:47:15,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:15,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:15,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:15,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:15,759 INFO L87 Difference]: Start difference. First operand 802 states and 3163 transitions. Second operand 10 states. [2020-02-10 20:47:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:15,918 INFO L93 Difference]: Finished difference Result 1470 states and 5089 transitions. [2020-02-10 20:47:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:15,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:15,921 INFO L225 Difference]: With dead ends: 1470 [2020-02-10 20:47:15,922 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 20:47:15,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 20:47:15,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 797. [2020-02-10 20:47:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:47:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3149 transitions. [2020-02-10 20:47:15,957 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3149 transitions. Word has length 25 [2020-02-10 20:47:15,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:15,957 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3149 transitions. [2020-02-10 20:47:15,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3149 transitions. [2020-02-10 20:47:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:15,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:15,959 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:15,959 INFO L427 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-02-10 20:47:15,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:15,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1691343769, now seen corresponding path program 677 times [2020-02-10 20:47:15,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:15,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723066334] [2020-02-10 20:47:15,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:16,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-02-10 20:47:16,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723066334] [2020-02-10 20:47:16,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:16,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:16,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738482022] [2020-02-10 20:47:16,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:16,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:16,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:16,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:16,367 INFO L87 Difference]: Start difference. First operand 797 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:47:16,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:16,495 INFO L93 Difference]: Finished difference Result 1473 states and 5095 transitions. [2020-02-10 20:47:16,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:16,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:16,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:16,498 INFO L225 Difference]: With dead ends: 1473 [2020-02-10 20:47:16,498 INFO L226 Difference]: Without dead ends: 1457 [2020-02-10 20:47:16,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-02-10 20:47:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-02-10 20:47:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 802. [2020-02-10 20:47:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:47:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3158 transitions. [2020-02-10 20:47:16,523 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3158 transitions. Word has length 25 [2020-02-10 20:47:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:16,523 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3158 transitions. [2020-02-10 20:47:16,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3158 transitions. [2020-02-10 20:47:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:16,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:16,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-02-10 20:47:16,524 INFO L427 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-02-10 20:47:16,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:16,524 INFO L82 PathProgramCache]: Analyzing trace with hash -992682569, now seen corresponding path program 678 times [2020-02-10 20:47:16,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:16,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812923695] [2020-02-10 20:47:16,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:16,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812923695] [2020-02-10 20:47:16,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:16,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:16,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349270103] [2020-02-10 20:47:16,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:16,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:16,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:16,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:16,940 INFO L87 Difference]: Start difference. First operand 802 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:47:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:17,093 INFO L93 Difference]: Finished difference Result 1471 states and 5086 transitions. [2020-02-10 20:47:17,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:17,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:17,097 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 20:47:17,097 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 20:47:17,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-02-10 20:47:17,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 20:47:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 792. [2020-02-10 20:47:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:47:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3135 transitions. [2020-02-10 20:47:17,121 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3135 transitions. Word has length 25 [2020-02-10 20:47:17,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:17,121 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3135 transitions. [2020-02-10 20:47:17,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:17,122 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3135 transitions. [2020-02-10 20:47:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:17,122 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:17,123 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:17,123 INFO L427 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-02-10 20:47:17,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:17,123 INFO L82 PathProgramCache]: Analyzing trace with hash 901842197, now seen corresponding path program 679 times [2020-02-10 20:47:17,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:17,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045221541] [2020-02-10 20:47:17,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:17,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045221541] [2020-02-10 20:47:17,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:17,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:17,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889096328] [2020-02-10 20:47:17,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:17,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:17,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:17,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:17,541 INFO L87 Difference]: Start difference. First operand 792 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:47:17,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:17,692 INFO L93 Difference]: Finished difference Result 1488 states and 5134 transitions. [2020-02-10 20:47:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:17,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:17,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:17,696 INFO L225 Difference]: With dead ends: 1488 [2020-02-10 20:47:17,696 INFO L226 Difference]: Without dead ends: 1473 [2020-02-10 20:47:17,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:17,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-02-10 20:47:17,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 807. [2020-02-10 20:47:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:47:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3175 transitions. [2020-02-10 20:47:17,720 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3175 transitions. Word has length 25 [2020-02-10 20:47:17,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:17,720 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3175 transitions. [2020-02-10 20:47:17,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3175 transitions. [2020-02-10 20:47:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:17,722 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:17,722 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:17,722 INFO L427 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-02-10 20:47:17,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:17,722 INFO L82 PathProgramCache]: Analyzing trace with hash -171243183, now seen corresponding path program 680 times [2020-02-10 20:47:17,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:17,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475803206] [2020-02-10 20:47:17,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:18,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475803206] [2020-02-10 20:47:18,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:18,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:18,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785816455] [2020-02-10 20:47:18,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:18,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:18,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:18,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:18,143 INFO L87 Difference]: Start difference. First operand 807 states and 3175 transitions. Second operand 10 states. [2020-02-10 20:47:18,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:18,273 INFO L93 Difference]: Finished difference Result 1489 states and 5130 transitions. [2020-02-10 20:47:18,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:18,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:18,277 INFO L225 Difference]: With dead ends: 1489 [2020-02-10 20:47:18,278 INFO L226 Difference]: Without dead ends: 1467 [2020-02-10 20:47:18,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-02-10 20:47:18,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-02-10 20:47:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 801. [2020-02-10 20:47:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:47:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3158 transitions. [2020-02-10 20:47:18,302 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3158 transitions. Word has length 25 [2020-02-10 20:47:18,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:18,303 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3158 transitions. [2020-02-10 20:47:18,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3158 transitions. [2020-02-10 20:47:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:18,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:18,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-02-10 20:47:18,304 INFO L427 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-02-10 20:47:18,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:18,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1995933785, now seen corresponding path program 681 times [2020-02-10 20:47:18,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:18,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485794858] [2020-02-10 20:47:18,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:18,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-02-10 20:47:18,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485794858] [2020-02-10 20:47:18,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:18,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:18,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585647474] [2020-02-10 20:47:18,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:18,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:18,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:18,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:18,722 INFO L87 Difference]: Start difference. First operand 801 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:47:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:18,851 INFO L93 Difference]: Finished difference Result 1491 states and 5133 transitions. [2020-02-10 20:47:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:18,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:18,855 INFO L225 Difference]: With dead ends: 1491 [2020-02-10 20:47:18,856 INFO L226 Difference]: Without dead ends: 1476 [2020-02-10 20:47:18,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:18,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-02-10 20:47:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 808. [2020-02-10 20:47:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-02-10 20:47:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3171 transitions. [2020-02-10 20:47:18,880 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3171 transitions. Word has length 25 [2020-02-10 20:47:18,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:18,880 INFO L479 AbstractCegarLoop]: Abstraction has 808 states and 3171 transitions. [2020-02-10 20:47:18,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:18,880 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3171 transitions. [2020-02-10 20:47:18,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:18,881 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:18,881 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:18,881 INFO L427 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-02-10 20:47:18,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:18,882 INFO L82 PathProgramCache]: Analyzing trace with hash -150236975, now seen corresponding path program 682 times [2020-02-10 20:47:18,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:18,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242547213] [2020-02-10 20:47:18,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:19,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242547213] [2020-02-10 20:47:19,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:19,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:19,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580032596] [2020-02-10 20:47:19,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:19,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:19,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:19,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:19,306 INFO L87 Difference]: Start difference. First operand 808 states and 3171 transitions. Second operand 10 states. [2020-02-10 20:47:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:19,409 INFO L93 Difference]: Finished difference Result 1494 states and 5132 transitions. [2020-02-10 20:47:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:19,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:19,413 INFO L225 Difference]: With dead ends: 1494 [2020-02-10 20:47:19,413 INFO L226 Difference]: Without dead ends: 1469 [2020-02-10 20:47:19,414 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:19,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-02-10 20:47:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 801. [2020-02-10 20:47:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:47:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3151 transitions. [2020-02-10 20:47:19,438 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3151 transitions. Word has length 25 [2020-02-10 20:47:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:19,438 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3151 transitions. [2020-02-10 20:47:19,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3151 transitions. [2020-02-10 20:47:19,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:19,439 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:19,439 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:19,440 INFO L427 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-02-10 20:47:19,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:19,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2016939993, now seen corresponding path program 683 times [2020-02-10 20:47:19,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:19,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775318940] [2020-02-10 20:47:19,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:19,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775318940] [2020-02-10 20:47:19,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:19,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:19,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410602725] [2020-02-10 20:47:19,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:19,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:19,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:19,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:19,862 INFO L87 Difference]: Start difference. First operand 801 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:47:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:19,989 INFO L93 Difference]: Finished difference Result 1495 states and 5134 transitions. [2020-02-10 20:47:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:19,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:19,993 INFO L225 Difference]: With dead ends: 1495 [2020-02-10 20:47:19,993 INFO L226 Difference]: Without dead ends: 1479 [2020-02-10 20:47:19,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2020-02-10 20:47:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 810. [2020-02-10 20:47:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-02-10 20:47:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3167 transitions. [2020-02-10 20:47:20,018 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3167 transitions. Word has length 25 [2020-02-10 20:47:20,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:20,018 INFO L479 AbstractCegarLoop]: Abstraction has 810 states and 3167 transitions. [2020-02-10 20:47:20,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3167 transitions. [2020-02-10 20:47:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:20,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:20,020 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:20,020 INFO L427 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-02-10 20:47:20,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:20,020 INFO L82 PathProgramCache]: Analyzing trace with hash 943854613, now seen corresponding path program 684 times [2020-02-10 20:47:20,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:20,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954703127] [2020-02-10 20:47:20,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:20,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954703127] [2020-02-10 20:47:20,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:20,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:20,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929630072] [2020-02-10 20:47:20,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:20,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:20,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:20,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:20,468 INFO L87 Difference]: Start difference. First operand 810 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:47:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:20,583 INFO L93 Difference]: Finished difference Result 1497 states and 5130 transitions. [2020-02-10 20:47:20,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:20,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:20,587 INFO L225 Difference]: With dead ends: 1497 [2020-02-10 20:47:20,587 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 20:47:20,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:20,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 20:47:20,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 792. [2020-02-10 20:47:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:47:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3127 transitions. [2020-02-10 20:47:20,612 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3127 transitions. Word has length 25 [2020-02-10 20:47:20,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:20,612 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3127 transitions. [2020-02-10 20:47:20,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3127 transitions. [2020-02-10 20:47:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:20,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:20,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-02-10 20:47:20,613 INFO L427 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-02-10 20:47:20,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:20,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1227438421, now seen corresponding path program 685 times [2020-02-10 20:47:20,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:20,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009703213] [2020-02-10 20:47:20,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:21,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009703213] [2020-02-10 20:47:21,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:21,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:21,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807710350] [2020-02-10 20:47:21,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:21,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:21,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:21,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:21,042 INFO L87 Difference]: Start difference. First operand 792 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:47:21,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:21,171 INFO L93 Difference]: Finished difference Result 1476 states and 5098 transitions. [2020-02-10 20:47:21,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:21,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:21,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:21,175 INFO L225 Difference]: With dead ends: 1476 [2020-02-10 20:47:21,175 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 20:47:21,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:21,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 20:47:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 803. [2020-02-10 20:47:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:47:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3158 transitions. [2020-02-10 20:47:21,199 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3158 transitions. Word has length 25 [2020-02-10 20:47:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:21,199 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3158 transitions. [2020-02-10 20:47:21,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3158 transitions. [2020-02-10 20:47:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:21,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:21,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-02-10 20:47:21,201 INFO L427 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-02-10 20:47:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:21,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1765293999, now seen corresponding path program 686 times [2020-02-10 20:47:21,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:21,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298099292] [2020-02-10 20:47:21,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:21,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298099292] [2020-02-10 20:47:21,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:21,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:21,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898725221] [2020-02-10 20:47:21,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:21,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:21,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:21,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:21,613 INFO L87 Difference]: Start difference. First operand 803 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:47:21,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:21,746 INFO L93 Difference]: Finished difference Result 1475 states and 5091 transitions. [2020-02-10 20:47:21,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:21,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:21,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:21,751 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 20:47:21,751 INFO L226 Difference]: Without dead ends: 1456 [2020-02-10 20:47:21,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-02-10 20:47:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 798. [2020-02-10 20:47:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:47:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3144 transitions. [2020-02-10 20:47:21,775 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3144 transitions. Word has length 25 [2020-02-10 20:47:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:21,775 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3144 transitions. [2020-02-10 20:47:21,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3144 transitions. [2020-02-10 20:47:21,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:21,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:21,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-02-10 20:47:21,776 INFO L427 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-02-10 20:47:21,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:21,777 INFO L82 PathProgramCache]: Analyzing trace with hash -372999433, now seen corresponding path program 687 times [2020-02-10 20:47:21,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:21,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189503990] [2020-02-10 20:47:21,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:22,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189503990] [2020-02-10 20:47:22,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:22,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:22,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238680870] [2020-02-10 20:47:22,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:22,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:22,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:22,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:22,191 INFO L87 Difference]: Start difference. First operand 798 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:47:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:22,326 INFO L93 Difference]: Finished difference Result 1482 states and 5105 transitions. [2020-02-10 20:47:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:22,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:22,331 INFO L225 Difference]: With dead ends: 1482 [2020-02-10 20:47:22,331 INFO L226 Difference]: Without dead ends: 1467 [2020-02-10 20:47:22,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-02-10 20:47:22,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-02-10 20:47:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 805. [2020-02-10 20:47:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 20:47:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3157 transitions. [2020-02-10 20:47:22,355 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3157 transitions. Word has length 25 [2020-02-10 20:47:22,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:22,355 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3157 transitions. [2020-02-10 20:47:22,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:22,355 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3157 transitions. [2020-02-10 20:47:22,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:22,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:22,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-02-10 20:47:22,356 INFO L427 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-02-10 20:47:22,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:22,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1775797103, now seen corresponding path program 688 times [2020-02-10 20:47:22,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:22,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893325232] [2020-02-10 20:47:22,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:22,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893325232] [2020-02-10 20:47:22,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:22,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:22,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795715443] [2020-02-10 20:47:22,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:22,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:22,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:22,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:22,775 INFO L87 Difference]: Start difference. First operand 805 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:47:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:22,878 INFO L93 Difference]: Finished difference Result 1485 states and 5104 transitions. [2020-02-10 20:47:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:22,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:22,882 INFO L225 Difference]: With dead ends: 1485 [2020-02-10 20:47:22,882 INFO L226 Difference]: Without dead ends: 1460 [2020-02-10 20:47:22,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-02-10 20:47:22,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 798. [2020-02-10 20:47:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:47:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3138 transitions. [2020-02-10 20:47:22,907 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3138 transitions. Word has length 25 [2020-02-10 20:47:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:22,907 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3138 transitions. [2020-02-10 20:47:22,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3138 transitions. [2020-02-10 20:47:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:22,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:22,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-02-10 20:47:22,908 INFO L427 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-02-10 20:47:22,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:22,909 INFO L82 PathProgramCache]: Analyzing trace with hash -341490121, now seen corresponding path program 689 times [2020-02-10 20:47:22,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:22,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375791235] [2020-02-10 20:47:22,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:23,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375791235] [2020-02-10 20:47:23,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:23,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:23,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256534975] [2020-02-10 20:47:23,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:23,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:23,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:23,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:23,323 INFO L87 Difference]: Start difference. First operand 798 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:47:23,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:23,455 INFO L93 Difference]: Finished difference Result 1479 states and 5092 transitions. [2020-02-10 20:47:23,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:23,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:23,459 INFO L225 Difference]: With dead ends: 1479 [2020-02-10 20:47:23,459 INFO L226 Difference]: Without dead ends: 1465 [2020-02-10 20:47:23,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-02-10 20:47:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 804. [2020-02-10 20:47:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:47:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3149 transitions. [2020-02-10 20:47:23,484 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3149 transitions. Word has length 25 [2020-02-10 20:47:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:23,484 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3149 transitions. [2020-02-10 20:47:23,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:23,484 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3149 transitions. [2020-02-10 20:47:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:23,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:23,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-02-10 20:47:23,485 INFO L427 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-02-10 20:47:23,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:23,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1269450837, now seen corresponding path program 690 times [2020-02-10 20:47:23,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:23,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516166125] [2020-02-10 20:47:23,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:23,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516166125] [2020-02-10 20:47:23,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:23,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:23,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095644074] [2020-02-10 20:47:23,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:23,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:23,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:23,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:23,900 INFO L87 Difference]: Start difference. First operand 804 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:47:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:24,003 INFO L93 Difference]: Finished difference Result 1483 states and 5094 transitions. [2020-02-10 20:47:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:24,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:24,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:24,007 INFO L225 Difference]: With dead ends: 1483 [2020-02-10 20:47:24,008 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 20:47:24,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:24,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 20:47:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 792. [2020-02-10 20:47:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:47:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3121 transitions. [2020-02-10 20:47:24,032 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3121 transitions. Word has length 25 [2020-02-10 20:47:24,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:24,032 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3121 transitions. [2020-02-10 20:47:24,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3121 transitions. [2020-02-10 20:47:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:24,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:24,033 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:24,033 INFO L427 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-02-10 20:47:24,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:24,034 INFO L82 PathProgramCache]: Analyzing trace with hash 805545489, now seen corresponding path program 691 times [2020-02-10 20:47:24,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:24,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3268888] [2020-02-10 20:47:24,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:24,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3268888] [2020-02-10 20:47:24,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:24,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:24,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652771827] [2020-02-10 20:47:24,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:24,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:24,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:24,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:24,442 INFO L87 Difference]: Start difference. First operand 792 states and 3121 transitions. Second operand 10 states. [2020-02-10 20:47:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:24,589 INFO L93 Difference]: Finished difference Result 1482 states and 5104 transitions. [2020-02-10 20:47:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:24,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:24,593 INFO L225 Difference]: With dead ends: 1482 [2020-02-10 20:47:24,594 INFO L226 Difference]: Without dead ends: 1466 [2020-02-10 20:47:24,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-02-10 20:47:24,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2020-02-10 20:47:24,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 804. [2020-02-10 20:47:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:47:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3154 transitions. [2020-02-10 20:47:24,618 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3154 transitions. Word has length 25 [2020-02-10 20:47:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:24,618 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3154 transitions. [2020-02-10 20:47:24,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3154 transitions. [2020-02-10 20:47:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:24,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:24,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-02-10 20:47:24,642 INFO L427 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-02-10 20:47:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:24,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1878480849, now seen corresponding path program 692 times [2020-02-10 20:47:24,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:24,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470147382] [2020-02-10 20:47:24,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:25,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470147382] [2020-02-10 20:47:25,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:25,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:25,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619879512] [2020-02-10 20:47:25,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:25,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:25,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:25,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:25,056 INFO L87 Difference]: Start difference. First operand 804 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:47:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:25,192 INFO L93 Difference]: Finished difference Result 1480 states and 5095 transitions. [2020-02-10 20:47:25,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:25,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:25,196 INFO L225 Difference]: With dead ends: 1480 [2020-02-10 20:47:25,196 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 20:47:25,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 20:47:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 799. [2020-02-10 20:47:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:47:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3140 transitions. [2020-02-10 20:47:25,220 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3140 transitions. Word has length 25 [2020-02-10 20:47:25,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:25,220 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3140 transitions. [2020-02-10 20:47:25,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3140 transitions. [2020-02-10 20:47:25,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:25,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:25,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-02-10 20:47:25,222 INFO L427 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-02-10 20:47:25,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:25,222 INFO L82 PathProgramCache]: Analyzing trace with hash -794892365, now seen corresponding path program 693 times [2020-02-10 20:47:25,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:25,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791927879] [2020-02-10 20:47:25,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:25,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791927879] [2020-02-10 20:47:25,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:25,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:25,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925513549] [2020-02-10 20:47:25,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:25,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:25,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:25,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:25,636 INFO L87 Difference]: Start difference. First operand 799 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:47:25,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:25,801 INFO L93 Difference]: Finished difference Result 1490 states and 5115 transitions. [2020-02-10 20:47:25,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:25,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:25,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:25,805 INFO L225 Difference]: With dead ends: 1490 [2020-02-10 20:47:25,806 INFO L226 Difference]: Without dead ends: 1474 [2020-02-10 20:47:25,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-02-10 20:47:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2020-02-10 20:47:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 808. [2020-02-10 20:47:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-02-10 20:47:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3156 transitions. [2020-02-10 20:47:25,830 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3156 transitions. Word has length 25 [2020-02-10 20:47:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:25,830 INFO L479 AbstractCegarLoop]: Abstraction has 808 states and 3156 transitions. [2020-02-10 20:47:25,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:25,830 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3156 transitions. [2020-02-10 20:47:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:25,831 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:25,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-02-10 20:47:25,831 INFO L427 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-02-10 20:47:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:25,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1867977745, now seen corresponding path program 694 times [2020-02-10 20:47:25,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:25,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118248145] [2020-02-10 20:47:25,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:26,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118248145] [2020-02-10 20:47:26,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:26,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:26,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413964077] [2020-02-10 20:47:26,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:26,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:26,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:26,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:26,257 INFO L87 Difference]: Start difference. First operand 808 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:47:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:26,366 INFO L93 Difference]: Finished difference Result 1492 states and 5111 transitions. [2020-02-10 20:47:26,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:26,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:26,370 INFO L225 Difference]: With dead ends: 1492 [2020-02-10 20:47:26,370 INFO L226 Difference]: Without dead ends: 1465 [2020-02-10 20:47:26,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:26,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-02-10 20:47:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 799. [2020-02-10 20:47:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:47:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3133 transitions. [2020-02-10 20:47:26,394 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3133 transitions. Word has length 25 [2020-02-10 20:47:26,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:26,394 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3133 transitions. [2020-02-10 20:47:26,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3133 transitions. [2020-02-10 20:47:26,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:26,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:26,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:26,396 INFO L427 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-02-10 20:47:26,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:26,396 INFO L82 PathProgramCache]: Analyzing trace with hash -784389261, now seen corresponding path program 695 times [2020-02-10 20:47:26,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:26,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825960027] [2020-02-10 20:47:26,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:26,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825960027] [2020-02-10 20:47:26,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:26,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:26,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572261814] [2020-02-10 20:47:26,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:26,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:26,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:26,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:26,812 INFO L87 Difference]: Start difference. First operand 799 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:47:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:26,946 INFO L93 Difference]: Finished difference Result 1483 states and 5093 transitions. [2020-02-10 20:47:26,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:26,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:26,950 INFO L225 Difference]: With dead ends: 1483 [2020-02-10 20:47:26,950 INFO L226 Difference]: Without dead ends: 1469 [2020-02-10 20:47:26,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-02-10 20:47:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 805. [2020-02-10 20:47:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 20:47:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3144 transitions. [2020-02-10 20:47:26,975 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3144 transitions. Word has length 25 [2020-02-10 20:47:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:26,975 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3144 transitions. [2020-02-10 20:47:26,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3144 transitions. [2020-02-10 20:47:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:26,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:26,977 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:26,977 INFO L427 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-02-10 20:47:26,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:26,978 INFO L82 PathProgramCache]: Analyzing trace with hash 826551697, now seen corresponding path program 696 times [2020-02-10 20:47:26,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:26,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687024283] [2020-02-10 20:47:26,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:27,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687024283] [2020-02-10 20:47:27,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:27,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:27,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316800815] [2020-02-10 20:47:27,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:27,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:27,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:27,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:27,410 INFO L87 Difference]: Start difference. First operand 805 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:47:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:27,521 INFO L93 Difference]: Finished difference Result 1487 states and 5095 transitions. [2020-02-10 20:47:27,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:27,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:27,525 INFO L225 Difference]: With dead ends: 1487 [2020-02-10 20:47:27,525 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 20:47:27,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-02-10 20:47:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 20:47:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 783. [2020-02-10 20:47:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:47:27,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3099 transitions. [2020-02-10 20:47:27,550 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3099 transitions. Word has length 25 [2020-02-10 20:47:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:27,550 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3099 transitions. [2020-02-10 20:47:27,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3099 transitions. [2020-02-10 20:47:27,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:27,551 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:27,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-02-10 20:47:27,551 INFO L427 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-02-10 20:47:27,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash 489859575, now seen corresponding path program 697 times [2020-02-10 20:47:27,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:27,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573893253] [2020-02-10 20:47:27,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:27,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573893253] [2020-02-10 20:47:27,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:27,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:27,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301695131] [2020-02-10 20:47:27,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:27,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:27,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:27,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:27,930 INFO L87 Difference]: Start difference. First operand 783 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:47:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:28,067 INFO L93 Difference]: Finished difference Result 1432 states and 4979 transitions. [2020-02-10 20:47:28,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:28,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:28,072 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:47:28,072 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 20:47:28,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:28,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 20:47:28,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 794. [2020-02-10 20:47:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:47:28,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3136 transitions. [2020-02-10 20:47:28,096 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3136 transitions. Word has length 25 [2020-02-10 20:47:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:28,097 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3136 transitions. [2020-02-10 20:47:28,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3136 transitions. [2020-02-10 20:47:28,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:28,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:28,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-02-10 20:47:28,098 INFO L427 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-02-10 20:47:28,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:28,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2100800533, now seen corresponding path program 698 times [2020-02-10 20:47:28,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:28,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187695259] [2020-02-10 20:47:28,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:28,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187695259] [2020-02-10 20:47:28,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:28,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:28,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719564819] [2020-02-10 20:47:28,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:28,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:28,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:28,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:28,489 INFO L87 Difference]: Start difference. First operand 794 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:47:28,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:28,657 INFO L93 Difference]: Finished difference Result 1436 states and 4984 transitions. [2020-02-10 20:47:28,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:28,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:28,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:28,661 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 20:47:28,661 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 20:47:28,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-02-10 20:47:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 20:47:28,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 791. [2020-02-10 20:47:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:47:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3128 transitions. [2020-02-10 20:47:28,684 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3128 transitions. Word has length 25 [2020-02-10 20:47:28,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:28,685 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3128 transitions. [2020-02-10 20:47:28,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3128 transitions. [2020-02-10 20:47:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:28,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:28,686 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:28,686 INFO L427 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-02-10 20:47:28,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:28,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1110578279, now seen corresponding path program 699 times [2020-02-10 20:47:28,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:28,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913198663] [2020-02-10 20:47:28,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:29,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913198663] [2020-02-10 20:47:29,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:29,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:29,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485140487] [2020-02-10 20:47:29,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:29,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:29,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:29,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:29,075 INFO L87 Difference]: Start difference. First operand 791 states and 3128 transitions. Second operand 10 states. [2020-02-10 20:47:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:29,219 INFO L93 Difference]: Finished difference Result 1430 states and 4972 transitions. [2020-02-10 20:47:29,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:29,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:29,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:29,223 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 20:47:29,223 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:47:29,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:47:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 794. [2020-02-10 20:47:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:47:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3133 transitions. [2020-02-10 20:47:29,248 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3133 transitions. Word has length 25 [2020-02-10 20:47:29,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:29,249 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3133 transitions. [2020-02-10 20:47:29,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3133 transitions. [2020-02-10 20:47:29,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:29,250 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:29,250 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:29,250 INFO L427 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-02-10 20:47:29,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:29,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2111303637, now seen corresponding path program 700 times [2020-02-10 20:47:29,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:29,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253508336] [2020-02-10 20:47:29,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:29,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253508336] [2020-02-10 20:47:29,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:29,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:29,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706859467] [2020-02-10 20:47:29,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:29,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:29,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:29,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:29,633 INFO L87 Difference]: Start difference. First operand 794 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:47:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:29,771 INFO L93 Difference]: Finished difference Result 1432 states and 4973 transitions. [2020-02-10 20:47:29,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:29,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:29,775 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:47:29,776 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 20:47:29,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 20:47:29,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 791. [2020-02-10 20:47:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:47:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3125 transitions. [2020-02-10 20:47:29,800 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3125 transitions. Word has length 25 [2020-02-10 20:47:29,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:29,800 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3125 transitions. [2020-02-10 20:47:29,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3125 transitions. [2020-02-10 20:47:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:29,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:29,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-02-10 20:47:29,801 INFO L427 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-02-10 20:47:29,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:29,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1100075175, now seen corresponding path program 701 times [2020-02-10 20:47:29,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:29,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202780599] [2020-02-10 20:47:29,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:30,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202780599] [2020-02-10 20:47:30,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:30,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:30,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057260995] [2020-02-10 20:47:30,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:30,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:30,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:30,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:30,189 INFO L87 Difference]: Start difference. First operand 791 states and 3125 transitions. Second operand 10 states. [2020-02-10 20:47:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:30,324 INFO L93 Difference]: Finished difference Result 1440 states and 4991 transitions. [2020-02-10 20:47:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:30,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:30,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:30,328 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:47:30,328 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:47:30,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:47:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 796. [2020-02-10 20:47:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:47:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3134 transitions. [2020-02-10 20:47:30,353 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3134 transitions. Word has length 25 [2020-02-10 20:47:30,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:30,353 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3134 transitions. [2020-02-10 20:47:30,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3134 transitions. [2020-02-10 20:47:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:30,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:30,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-02-10 20:47:30,354 INFO L427 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-02-10 20:47:30,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:30,354 INFO L82 PathProgramCache]: Analyzing trace with hash 510865783, now seen corresponding path program 702 times [2020-02-10 20:47:30,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:30,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087600368] [2020-02-10 20:47:30,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:30,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087600368] [2020-02-10 20:47:30,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:30,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:30,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772003915] [2020-02-10 20:47:30,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:30,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:30,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:30,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:30,742 INFO L87 Difference]: Start difference. First operand 796 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:47:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:30,902 INFO L93 Difference]: Finished difference Result 1438 states and 4982 transitions. [2020-02-10 20:47:30,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:30,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:30,906 INFO L225 Difference]: With dead ends: 1438 [2020-02-10 20:47:30,906 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:47:30,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:30,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:47:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 788. [2020-02-10 20:47:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:47:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3117 transitions. [2020-02-10 20:47:30,930 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3117 transitions. Word has length 25 [2020-02-10 20:47:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:30,931 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3117 transitions. [2020-02-10 20:47:30,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3117 transitions. [2020-02-10 20:47:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:30,932 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:30,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-02-10 20:47:30,932 INFO L427 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-02-10 20:47:30,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:30,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1879073643, now seen corresponding path program 703 times [2020-02-10 20:47:30,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:30,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478151106] [2020-02-10 20:47:30,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:31,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478151106] [2020-02-10 20:47:31,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:31,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:31,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281513663] [2020-02-10 20:47:31,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:31,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:31,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:31,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:31,322 INFO L87 Difference]: Start difference. First operand 788 states and 3117 transitions. Second operand 10 states. [2020-02-10 20:47:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:31,484 INFO L93 Difference]: Finished difference Result 1443 states and 4999 transitions. [2020-02-10 20:47:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:31,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:31,488 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 20:47:31,488 INFO L226 Difference]: Without dead ends: 1431 [2020-02-10 20:47:31,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:31,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-02-10 20:47:31,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 796. [2020-02-10 20:47:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:47:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3138 transitions. [2020-02-10 20:47:31,513 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3138 transitions. Word has length 25 [2020-02-10 20:47:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:31,513 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3138 transitions. [2020-02-10 20:47:31,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3138 transitions. [2020-02-10 20:47:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:31,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:31,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-02-10 20:47:31,514 INFO L427 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-02-10 20:47:31,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:31,514 INFO L82 PathProgramCache]: Analyzing trace with hash -268132685, now seen corresponding path program 704 times [2020-02-10 20:47:31,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:31,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991825543] [2020-02-10 20:47:31,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:31,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991825543] [2020-02-10 20:47:31,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:31,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:31,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417901157] [2020-02-10 20:47:31,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:31,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:31,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:31,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:31,904 INFO L87 Difference]: Start difference. First operand 796 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:47:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:32,040 INFO L93 Difference]: Finished difference Result 1447 states and 5004 transitions. [2020-02-10 20:47:32,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:32,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:32,045 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:47:32,045 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:47:32,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-02-10 20:47:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:47:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 793. [2020-02-10 20:47:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:47:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3130 transitions. [2020-02-10 20:47:32,069 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3130 transitions. Word has length 25 [2020-02-10 20:47:32,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:32,069 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3130 transitions. [2020-02-10 20:47:32,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3130 transitions. [2020-02-10 20:47:32,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:32,070 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:32,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-02-10 20:47:32,071 INFO L427 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-02-10 20:47:32,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:32,071 INFO L82 PathProgramCache]: Analyzing trace with hash -784982055, now seen corresponding path program 705 times [2020-02-10 20:47:32,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:32,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077312630] [2020-02-10 20:47:32,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:32,478 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2020-02-10 20:47:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:32,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077312630] [2020-02-10 20:47:32,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:32,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:32,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890527405] [2020-02-10 20:47:32,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:32,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:32,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:32,484 INFO L87 Difference]: Start difference. First operand 793 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:47:32,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:32,623 INFO L93 Difference]: Finished difference Result 1446 states and 5001 transitions. [2020-02-10 20:47:32,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:32,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:32,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:32,627 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 20:47:32,627 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 20:47:32,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-02-10 20:47:32,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 20:47:32,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-02-10 20:47:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:47:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3137 transitions. [2020-02-10 20:47:32,652 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3137 transitions. Word has length 25 [2020-02-10 20:47:32,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:32,652 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3137 transitions. [2020-02-10 20:47:32,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:32,652 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3137 transitions. [2020-02-10 20:47:32,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:32,653 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:32,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:32,654 INFO L427 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-02-10 20:47:32,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:32,654 INFO L82 PathProgramCache]: Analyzing trace with hash -247126477, now seen corresponding path program 706 times [2020-02-10 20:47:32,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:32,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882827129] [2020-02-10 20:47:32,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:33,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882827129] [2020-02-10 20:47:33,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:33,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:33,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558114132] [2020-02-10 20:47:33,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:33,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:33,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:33,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:33,047 INFO L87 Difference]: Start difference. First operand 797 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:47:33,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:33,156 INFO L93 Difference]: Finished difference Result 1452 states and 5009 transitions. [2020-02-10 20:47:33,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:33,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:33,160 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 20:47:33,160 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 20:47:33,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:33,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 20:47:33,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-02-10 20:47:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:47:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3126 transitions. [2020-02-10 20:47:33,186 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3126 transitions. Word has length 25 [2020-02-10 20:47:33,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:33,186 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3126 transitions. [2020-02-10 20:47:33,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3126 transitions. [2020-02-10 20:47:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:33,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:33,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-02-10 20:47:33,188 INFO L427 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-02-10 20:47:33,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:33,188 INFO L82 PathProgramCache]: Analyzing trace with hash -774478951, now seen corresponding path program 707 times [2020-02-10 20:47:33,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:33,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523837094] [2020-02-10 20:47:33,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:33,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523837094] [2020-02-10 20:47:33,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:33,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:33,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758109679] [2020-02-10 20:47:33,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:33,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:33,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:33,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:33,588 INFO L87 Difference]: Start difference. First operand 793 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:47:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:33,730 INFO L93 Difference]: Finished difference Result 1459 states and 5026 transitions. [2020-02-10 20:47:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:33,731 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:33,735 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 20:47:33,735 INFO L226 Difference]: Without dead ends: 1443 [2020-02-10 20:47:33,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-02-10 20:47:33,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-02-10 20:47:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 802. [2020-02-10 20:47:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:47:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3142 transitions. [2020-02-10 20:47:33,760 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3142 transitions. Word has length 25 [2020-02-10 20:47:33,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:33,760 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3142 transitions. [2020-02-10 20:47:33,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3142 transitions. [2020-02-10 20:47:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:33,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:33,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-02-10 20:47:33,761 INFO L427 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-02-10 20:47:33,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:33,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1847564331, now seen corresponding path program 708 times [2020-02-10 20:47:33,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:33,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490577076] [2020-02-10 20:47:33,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:34,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490577076] [2020-02-10 20:47:34,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:34,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:34,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717666336] [2020-02-10 20:47:34,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:34,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:34,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:34,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:34,174 INFO L87 Difference]: Start difference. First operand 802 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:47:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:34,290 INFO L93 Difference]: Finished difference Result 1461 states and 5022 transitions. [2020-02-10 20:47:34,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:34,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:34,294 INFO L225 Difference]: With dead ends: 1461 [2020-02-10 20:47:34,295 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 20:47:34,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-02-10 20:47:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 20:47:34,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 788. [2020-02-10 20:47:34,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:47:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3112 transitions. [2020-02-10 20:47:34,321 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3112 transitions. Word has length 25 [2020-02-10 20:47:34,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:34,321 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3112 transitions. [2020-02-10 20:47:34,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:34,321 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3112 transitions. [2020-02-10 20:47:34,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:34,322 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:34,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-02-10 20:47:34,322 INFO L427 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-02-10 20:47:34,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:34,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1553477419, now seen corresponding path program 709 times [2020-02-10 20:47:34,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:34,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355372517] [2020-02-10 20:47:34,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:34,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-02-10 20:47:34,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355372517] [2020-02-10 20:47:34,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:34,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:34,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047352497] [2020-02-10 20:47:34,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:34,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:34,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:34,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:34,722 INFO L87 Difference]: Start difference. First operand 788 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:47:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:34,883 INFO L93 Difference]: Finished difference Result 1435 states and 4977 transitions. [2020-02-10 20:47:34,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:34,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:34,887 INFO L225 Difference]: With dead ends: 1435 [2020-02-10 20:47:34,887 INFO L226 Difference]: Without dead ends: 1423 [2020-02-10 20:47:34,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-02-10 20:47:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-02-10 20:47:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 795. [2020-02-10 20:47:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:47:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3131 transitions. [2020-02-10 20:47:34,911 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3131 transitions. Word has length 25 [2020-02-10 20:47:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:34,911 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3131 transitions. [2020-02-10 20:47:34,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3131 transitions. [2020-02-10 20:47:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:34,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:34,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-02-10 20:47:34,913 INFO L427 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-02-10 20:47:34,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:34,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1668404497, now seen corresponding path program 710 times [2020-02-10 20:47:34,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:34,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693949046] [2020-02-10 20:47:34,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:35,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693949046] [2020-02-10 20:47:35,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:35,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:35,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569712890] [2020-02-10 20:47:35,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:35,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:35,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:35,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:35,310 INFO L87 Difference]: Start difference. First operand 795 states and 3131 transitions. Second operand 10 states. [2020-02-10 20:47:35,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:35,449 INFO L93 Difference]: Finished difference Result 1437 states and 4978 transitions. [2020-02-10 20:47:35,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:35,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:35,453 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 20:47:35,453 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 20:47:35,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 20:47:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 792. [2020-02-10 20:47:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:47:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3123 transitions. [2020-02-10 20:47:35,477 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3123 transitions. Word has length 25 [2020-02-10 20:47:35,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:35,477 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3123 transitions. [2020-02-10 20:47:35,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3123 transitions. [2020-02-10 20:47:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:35,478 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:35,479 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:35,479 INFO L427 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-02-10 20:47:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:35,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1141052023, now seen corresponding path program 711 times [2020-02-10 20:47:35,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:35,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452954818] [2020-02-10 20:47:35,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:35,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452954818] [2020-02-10 20:47:35,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:35,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:35,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503478591] [2020-02-10 20:47:35,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:35,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:35,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:35,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:35,878 INFO L87 Difference]: Start difference. First operand 792 states and 3123 transitions. Second operand 10 states. [2020-02-10 20:47:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:36,015 INFO L93 Difference]: Finished difference Result 1440 states and 4983 transitions. [2020-02-10 20:47:36,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:36,016 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:36,019 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:47:36,019 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:47:36,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-02-10 20:47:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:47:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 796. [2020-02-10 20:47:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:47:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3130 transitions. [2020-02-10 20:47:36,043 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3130 transitions. Word has length 25 [2020-02-10 20:47:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:36,043 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3130 transitions. [2020-02-10 20:47:36,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3130 transitions. [2020-02-10 20:47:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:36,044 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:36,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:36,045 INFO L427 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-02-10 20:47:36,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:36,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1678907601, now seen corresponding path program 712 times [2020-02-10 20:47:36,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:36,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978058141] [2020-02-10 20:47:36,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:36,455 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2020-02-10 20:47:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:36,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978058141] [2020-02-10 20:47:36,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:36,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:36,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326696986] [2020-02-10 20:47:36,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:36,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:36,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:36,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:36,462 INFO L87 Difference]: Start difference. First operand 796 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:47:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:36,575 INFO L93 Difference]: Finished difference Result 1446 states and 4991 transitions. [2020-02-10 20:47:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:36,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:36,579 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 20:47:36,579 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:47:36,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:47:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 792. [2020-02-10 20:47:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:47:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3119 transitions. [2020-02-10 20:47:36,603 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3119 transitions. Word has length 25 [2020-02-10 20:47:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:36,603 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3119 transitions. [2020-02-10 20:47:36,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3119 transitions. [2020-02-10 20:47:36,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:36,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:36,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-02-10 20:47:36,604 INFO L427 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-02-10 20:47:36,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:36,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1162058231, now seen corresponding path program 713 times [2020-02-10 20:47:36,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:36,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494312836] [2020-02-10 20:47:36,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:37,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494312836] [2020-02-10 20:47:37,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:37,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:37,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736420144] [2020-02-10 20:47:37,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:37,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:37,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:37,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:37,000 INFO L87 Difference]: Start difference. First operand 792 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:47:37,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:37,133 INFO L93 Difference]: Finished difference Result 1446 states and 4993 transitions. [2020-02-10 20:47:37,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:37,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:37,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:37,137 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 20:47:37,138 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:47:37,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:47:37,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 798. [2020-02-10 20:47:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:47:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3130 transitions. [2020-02-10 20:47:37,162 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3130 transitions. Word has length 25 [2020-02-10 20:47:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:37,162 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3130 transitions. [2020-02-10 20:47:37,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3130 transitions. [2020-02-10 20:47:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:37,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47: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-02-10 20:47:37,164 INFO L427 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-02-10 20:47:37,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:37,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1521968107, now seen corresponding path program 714 times [2020-02-10 20:47:37,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:37,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142228804] [2020-02-10 20:47:37,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:37,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142228804] [2020-02-10 20:47:37,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:37,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:37,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585193786] [2020-02-10 20:47:37,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:37,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:37,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:37,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:37,584 INFO L87 Difference]: Start difference. First operand 798 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:47:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:37,699 INFO L93 Difference]: Finished difference Result 1450 states and 4995 transitions. [2020-02-10 20:47:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:37,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:37,703 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 20:47:37,703 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 20:47:37,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:37,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 20:47:37,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 788. [2020-02-10 20:47:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:47:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3108 transitions. [2020-02-10 20:47:37,728 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3108 transitions. Word has length 25 [2020-02-10 20:47:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:37,728 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3108 transitions. [2020-02-10 20:47:37,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3108 transitions. [2020-02-10 20:47:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:37,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:37,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-02-10 20:47:37,730 INFO L427 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-02-10 20:47:37,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:37,730 INFO L82 PathProgramCache]: Analyzing trace with hash 383059763, now seen corresponding path program 715 times [2020-02-10 20:47:37,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:37,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316682730] [2020-02-10 20:47:37,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:38,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316682730] [2020-02-10 20:47:38,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:38,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:38,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177793411] [2020-02-10 20:47:38,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:38,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:38,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:38,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:38,129 INFO L87 Difference]: Start difference. First operand 788 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:47:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:38,261 INFO L93 Difference]: Finished difference Result 1459 states and 5032 transitions. [2020-02-10 20:47:38,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:38,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:38,265 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 20:47:38,265 INFO L226 Difference]: Without dead ends: 1443 [2020-02-10 20:47:38,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-02-10 20:47:38,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 800. [2020-02-10 20:47:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:47:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3141 transitions. [2020-02-10 20:47:38,289 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3141 transitions. Word has length 25 [2020-02-10 20:47:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:38,289 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3141 transitions. [2020-02-10 20:47:38,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3141 transitions. [2020-02-10 20:47:38,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:38,290 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:38,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-02-10 20:47:38,291 INFO L427 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-02-10 20:47:38,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:38,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1994000721, now seen corresponding path program 716 times [2020-02-10 20:47:38,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:38,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327058579] [2020-02-10 20:47:38,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:38,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327058579] [2020-02-10 20:47:38,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:38,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:38,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755191755] [2020-02-10 20:47:38,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:38,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:38,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:38,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:38,685 INFO L87 Difference]: Start difference. First operand 800 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:47:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:38,823 INFO L93 Difference]: Finished difference Result 1457 states and 5023 transitions. [2020-02-10 20:47:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:38,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:38,827 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:47:38,827 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 20:47:38,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-02-10 20:47:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 20:47:38,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 795. [2020-02-10 20:47:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:47:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3127 transitions. [2020-02-10 20:47:38,851 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3127 transitions. Word has length 25 [2020-02-10 20:47:38,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:38,851 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3127 transitions. [2020-02-10 20:47:38,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:38,851 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3127 transitions. [2020-02-10 20:47:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:38,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:38,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-02-10 20:47:38,853 INFO L427 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-02-10 20:47:38,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:38,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1217378091, now seen corresponding path program 717 times [2020-02-10 20:47:38,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:38,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474207911] [2020-02-10 20:47:38,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:39,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474207911] [2020-02-10 20:47:39,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:39,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:39,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509818310] [2020-02-10 20:47:39,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:39,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:39,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:39,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:39,294 INFO L87 Difference]: Start difference. First operand 795 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:47:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:39,433 INFO L93 Difference]: Finished difference Result 1467 states and 5043 transitions. [2020-02-10 20:47:39,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:39,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:39,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:39,438 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 20:47:39,438 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 20:47:39,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-02-10 20:47:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 20:47:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 804. [2020-02-10 20:47:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:47:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3143 transitions. [2020-02-10 20:47:39,462 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3143 transitions. Word has length 25 [2020-02-10 20:47:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:39,462 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3143 transitions. [2020-02-10 20:47:39,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3143 transitions. [2020-02-10 20:47:39,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:39,463 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:39,464 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:39,464 INFO L427 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-02-10 20:47:39,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:39,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2004503825, now seen corresponding path program 718 times [2020-02-10 20:47:39,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:39,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195196322] [2020-02-10 20:47:39,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:39,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195196322] [2020-02-10 20:47:39,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:39,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:39,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865109169] [2020-02-10 20:47:39,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:39,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:39,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:39,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:39,881 INFO L87 Difference]: Start difference. First operand 804 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:47:39,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:39,991 INFO L93 Difference]: Finished difference Result 1469 states and 5039 transitions. [2020-02-10 20:47:39,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:39,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:39,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:39,995 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 20:47:39,995 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 20:47:39,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:40,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 20:47:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 795. [2020-02-10 20:47:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:47:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3120 transitions. [2020-02-10 20:47:40,019 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3120 transitions. Word has length 25 [2020-02-10 20:47:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:40,020 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3120 transitions. [2020-02-10 20:47:40,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3120 transitions. [2020-02-10 20:47:40,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:40,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:40,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:40,021 INFO L427 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-02-10 20:47:40,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:40,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1206874987, now seen corresponding path program 719 times [2020-02-10 20:47:40,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:40,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232854779] [2020-02-10 20:47:40,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:40,441 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2020-02-10 20:47:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:40,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232854779] [2020-02-10 20:47:40,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:40,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:40,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900791694] [2020-02-10 20:47:40,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:40,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:40,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:40,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:40,446 INFO L87 Difference]: Start difference. First operand 795 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:47:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:40,578 INFO L93 Difference]: Finished difference Result 1460 states and 5021 transitions. [2020-02-10 20:47:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:40,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:40,583 INFO L225 Difference]: With dead ends: 1460 [2020-02-10 20:47:40,583 INFO L226 Difference]: Without dead ends: 1446 [2020-02-10 20:47: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-02-10 20:47:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-02-10 20:47:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 801. [2020-02-10 20:47:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:47:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3131 transitions. [2020-02-10 20:47:40,608 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3131 transitions. Word has length 25 [2020-02-10 20:47:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:40,608 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3131 transitions. [2020-02-10 20:47:40,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3131 transitions. [2020-02-10 20:47:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:40,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:40,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-02-10 20:47:40,609 INFO L427 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-02-10 20:47:40,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:40,609 INFO L82 PathProgramCache]: Analyzing trace with hash 404065971, now seen corresponding path program 720 times [2020-02-10 20:47:40,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:40,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165412630] [2020-02-10 20:47:40,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:41,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165412630] [2020-02-10 20:47:41,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:41,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:41,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673176955] [2020-02-10 20:47:41,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:41,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:41,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:41,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:41,017 INFO L87 Difference]: Start difference. First operand 801 states and 3131 transitions. Second operand 10 states. [2020-02-10 20:47:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:41,137 INFO L93 Difference]: Finished difference Result 1464 states and 5023 transitions. [2020-02-10 20:47:41,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:41,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:41,141 INFO L225 Difference]: With dead ends: 1464 [2020-02-10 20:47:41,141 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:47:41,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-02-10 20:47:41,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:47:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 767. [2020-02-10 20:47:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2020-02-10 20:47:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 3065 transitions. [2020-02-10 20:47:41,165 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 3065 transitions. Word has length 25 [2020-02-10 20:47:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:41,165 INFO L479 AbstractCegarLoop]: Abstraction has 767 states and 3065 transitions. [2020-02-10 20:47:41,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:41,165 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 3065 transitions. [2020-02-10 20:47:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:41,166 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:41,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-02-10 20:47:41,166 INFO L427 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-02-10 20:47:41,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:41,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1154951873, now seen corresponding path program 721 times [2020-02-10 20:47:41,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:41,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626278251] [2020-02-10 20:47:41,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:41,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-02-10 20:47:41,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626278251] [2020-02-10 20:47:41,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:41,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:41,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384763142] [2020-02-10 20:47:41,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:41,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:41,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:41,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:41,551 INFO L87 Difference]: Start difference. First operand 767 states and 3065 transitions. Second operand 10 states. [2020-02-10 20:47:41,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:41,692 INFO L93 Difference]: Finished difference Result 1241 states and 4395 transitions. [2020-02-10 20:47:41,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:41,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:41,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:41,696 INFO L225 Difference]: With dead ends: 1241 [2020-02-10 20:47:41,696 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:47:41,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:47:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 782. [2020-02-10 20:47:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:47:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-02-10 20:47:41,720 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-02-10 20:47:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:41,720 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-02-10 20:47:41,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-02-10 20:47:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:41,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:41,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-02-10 20:47:41,721 INFO L427 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-02-10 20:47:41,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:41,721 INFO L82 PathProgramCache]: Analyzing trace with hash -184700259, now seen corresponding path program 722 times [2020-02-10 20:47:41,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:41,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89852824] [2020-02-10 20:47:41,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:42,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89852824] [2020-02-10 20:47:42,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:42,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:42,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150118340] [2020-02-10 20:47:42,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:42,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:42,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:42,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:42,100 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:47:42,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:42,242 INFO L93 Difference]: Finished difference Result 1243 states and 4395 transitions. [2020-02-10 20:47:42,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:42,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:42,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:42,246 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:47:42,246 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:47:42,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-02-10 20:47:42,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:47:42,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-02-10 20:47:42,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:47:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3117 transitions. [2020-02-10 20:47:42,270 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3117 transitions. Word has length 25 [2020-02-10 20:47:42,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:42,270 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3117 transitions. [2020-02-10 20:47:42,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:42,270 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3117 transitions. [2020-02-10 20:47:42,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:42,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:42,271 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:42,271 INFO L427 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-02-10 20:47:42,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:42,271 INFO L82 PathProgramCache]: Analyzing trace with hash 771082205, now seen corresponding path program 723 times [2020-02-10 20:47:42,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:42,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891733783] [2020-02-10 20:47:42,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:42,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891733783] [2020-02-10 20:47:42,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:42,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:42,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938442593] [2020-02-10 20:47:42,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:42,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:42,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:42,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:42,670 INFO L87 Difference]: Start difference. First operand 778 states and 3117 transitions. Second operand 10 states. [2020-02-10 20:47:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:42,807 INFO L93 Difference]: Finished difference Result 1237 states and 4383 transitions. [2020-02-10 20:47:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:42,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:42,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:42,811 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 20:47:42,811 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:47:42,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:47:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 781. [2020-02-10 20:47:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:47:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3122 transitions. [2020-02-10 20:47:42,834 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3122 transitions. Word has length 25 [2020-02-10 20:47:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:42,835 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3122 transitions. [2020-02-10 20:47:42,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3122 transitions. [2020-02-10 20:47:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:42,836 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:42,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-02-10 20:47:42,836 INFO L427 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-02-10 20:47:42,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:42,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1751836923, now seen corresponding path program 724 times [2020-02-10 20:47:42,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:42,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397554533] [2020-02-10 20:47:42,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:43,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397554533] [2020-02-10 20:47:43,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:43,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:43,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788469872] [2020-02-10 20:47:43,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:43,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:43,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:43,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:43,222 INFO L87 Difference]: Start difference. First operand 781 states and 3122 transitions. Second operand 10 states. [2020-02-10 20:47:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:43,382 INFO L93 Difference]: Finished difference Result 1236 states and 4378 transitions. [2020-02-10 20:47:43,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:43,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:43,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:43,385 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 20:47:43,386 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 20:47:43,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-02-10 20:47:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 20:47:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 778. [2020-02-10 20:47:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:47:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3114 transitions. [2020-02-10 20:47:43,409 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3114 transitions. Word has length 25 [2020-02-10 20:47:43,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:43,409 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3114 transitions. [2020-02-10 20:47:43,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3114 transitions. [2020-02-10 20:47:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:43,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:43,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-02-10 20:47:43,410 INFO L427 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-02-10 20:47:43,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash 153924927, now seen corresponding path program 725 times [2020-02-10 20:47:43,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:43,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653720375] [2020-02-10 20:47:43,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:43,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653720375] [2020-02-10 20:47:43,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:43,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:43,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279419354] [2020-02-10 20:47:43,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:43,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:43,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:43,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:43,797 INFO L87 Difference]: Start difference. First operand 778 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:47:43,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:43,936 INFO L93 Difference]: Finished difference Result 1241 states and 4388 transitions. [2020-02-10 20:47:43,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:43,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:43,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:43,940 INFO L225 Difference]: With dead ends: 1241 [2020-02-10 20:47:43,940 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:47:43,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:47:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-02-10 20:47:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:47:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-02-10 20:47:43,963 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-02-10 20:47:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:43,963 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-02-10 20:47:43,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-02-10 20:47:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:43,964 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:43,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-02-10 20:47:43,964 INFO L427 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-02-10 20:47:43,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:43,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1764865885, now seen corresponding path program 726 times [2020-02-10 20:47:43,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:43,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084680375] [2020-02-10 20:47:43,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:44,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084680375] [2020-02-10 20:47:44,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:44,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:44,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603701845] [2020-02-10 20:47:44,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:44,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:44,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:44,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:44,350 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:47:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:44,510 INFO L93 Difference]: Finished difference Result 1238 states and 4379 transitions. [2020-02-10 20:47:44,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:44,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:44,514 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:47:44,514 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 20:47:44,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-02-10 20:47:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 20:47:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 775. [2020-02-10 20:47:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:47:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3106 transitions. [2020-02-10 20:47:44,537 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3106 transitions. Word has length 25 [2020-02-10 20:47:44,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:44,538 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3106 transitions. [2020-02-10 20:47:44,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3106 transitions. [2020-02-10 20:47:44,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:44,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:44,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-02-10 20:47:44,539 INFO L427 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-02-10 20:47:44,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:44,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1577437599, now seen corresponding path program 727 times [2020-02-10 20:47:44,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:44,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014224778] [2020-02-10 20:47:44,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:44,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014224778] [2020-02-10 20:47:44,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:44,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:44,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898364767] [2020-02-10 20:47:44,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:44,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:44,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:44,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:44,916 INFO L87 Difference]: Start difference. First operand 775 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:47:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:45,056 INFO L93 Difference]: Finished difference Result 1250 states and 4416 transitions. [2020-02-10 20:47:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:45,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:45,060 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:47:45,060 INFO L226 Difference]: Without dead ends: 1237 [2020-02-10 20:47:45,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-02-10 20:47:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2020-02-10 20:47:45,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 783. [2020-02-10 20:47:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:47:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3128 transitions. [2020-02-10 20:47:45,083 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3128 transitions. Word has length 25 [2020-02-10 20:47:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:45,083 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3128 transitions. [2020-02-10 20:47:45,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3128 transitions. [2020-02-10 20:47:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:45,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:45,085 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:45,085 INFO L427 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-02-10 20:47:45,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:45,085 INFO L82 PathProgramCache]: Analyzing trace with hash -607185985, now seen corresponding path program 728 times [2020-02-10 20:47:45,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:45,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388582531] [2020-02-10 20:47:45,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:45,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388582531] [2020-02-10 20:47:45,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:45,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:45,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536796754] [2020-02-10 20:47:45,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:45,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:45,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:45,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:45,480 INFO L87 Difference]: Start difference. First operand 783 states and 3128 transitions. Second operand 10 states. [2020-02-10 20:47:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:45,651 INFO L93 Difference]: Finished difference Result 1252 states and 4416 transitions. [2020-02-10 20:47:45,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:45,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:45,655 INFO L225 Difference]: With dead ends: 1252 [2020-02-10 20:47:45,655 INFO L226 Difference]: Without dead ends: 1233 [2020-02-10 20:47:45,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-02-10 20:47:45,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-02-10 20:47:45,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 779. [2020-02-10 20:47:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:47:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3117 transitions. [2020-02-10 20:47:45,678 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3117 transitions. Word has length 25 [2020-02-10 20:47:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:45,678 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3117 transitions. [2020-02-10 20:47:45,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:45,678 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3117 transitions. [2020-02-10 20:47:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:45,679 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:45,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-02-10 20:47:45,679 INFO L427 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-02-10 20:47:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:45,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2020336739, now seen corresponding path program 729 times [2020-02-10 20:47:45,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:45,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370355932] [2020-02-10 20:47:45,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:46,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370355932] [2020-02-10 20:47:46,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:46,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:46,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347529159] [2020-02-10 20:47:46,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:46,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:46,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:46,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:46,065 INFO L87 Difference]: Start difference. First operand 779 states and 3117 transitions. Second operand 10 states. [2020-02-10 20:47:46,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:46,202 INFO L93 Difference]: Finished difference Result 1251 states and 4414 transitions. [2020-02-10 20:47:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:46,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:46,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:46,206 INFO L225 Difference]: With dead ends: 1251 [2020-02-10 20:47:46,206 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 20:47:46,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-02-10 20:47:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 20:47:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 783. [2020-02-10 20:47:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:47:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3124 transitions. [2020-02-10 20:47:46,229 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3124 transitions. Word has length 25 [2020-02-10 20:47:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:46,229 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3124 transitions. [2020-02-10 20:47:46,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3124 transitions. [2020-02-10 20:47:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:46,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:46,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:46,230 INFO L427 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-02-10 20:47:46,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:46,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1029078917, now seen corresponding path program 730 times [2020-02-10 20:47:46,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:46,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123312787] [2020-02-10 20:47:46,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:46,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123312787] [2020-02-10 20:47:46,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:46,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:46,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025594542] [2020-02-10 20:47:46,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:46,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:46,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:46,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:46,619 INFO L87 Difference]: Start difference. First operand 783 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:47:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:46,763 INFO L93 Difference]: Finished difference Result 1254 states and 4416 transitions. [2020-02-10 20:47:46,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:46,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:46,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:46,766 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 20:47:46,766 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 20:47:46,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 20:47:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 779. [2020-02-10 20:47:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:47:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3113 transitions. [2020-02-10 20:47:46,789 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3113 transitions. Word has length 25 [2020-02-10 20:47:46,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:46,789 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3113 transitions. [2020-02-10 20:47:46,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3113 transitions. [2020-02-10 20:47:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:46,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:46,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-02-10 20:47:46,790 INFO L427 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-02-10 20:47:46,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:46,790 INFO L82 PathProgramCache]: Analyzing trace with hash 57035425, now seen corresponding path program 731 times [2020-02-10 20:47:46,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:46,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398839551] [2020-02-10 20:47:46,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:47,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398839551] [2020-02-10 20:47:47,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:47,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:47,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609582151] [2020-02-10 20:47:47,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:47,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:47,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:47,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:47,180 INFO L87 Difference]: Start difference. First operand 779 states and 3113 transitions. Second operand 10 states. [2020-02-10 20:47:47,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:47,321 INFO L93 Difference]: Finished difference Result 1257 states and 4424 transitions. [2020-02-10 20:47:47,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:47,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:47,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:47,325 INFO L225 Difference]: With dead ends: 1257 [2020-02-10 20:47:47,325 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 20:47:47,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-02-10 20:47:47,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 20:47:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 785. [2020-02-10 20:47:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:47:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3124 transitions. [2020-02-10 20:47:47,348 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3124 transitions. Word has length 25 [2020-02-10 20:47:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:47,348 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3124 transitions. [2020-02-10 20:47:47,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3124 transitions. [2020-02-10 20:47:47,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:47,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:47,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-02-10 20:47:47,350 INFO L427 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-02-10 20:47:47,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:47,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1016049955, now seen corresponding path program 732 times [2020-02-10 20:47:47,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:47,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432689844] [2020-02-10 20:47:47,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:47,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432689844] [2020-02-10 20:47:47,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:47,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:47,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408743048] [2020-02-10 20:47:47,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:47,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:47,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:47,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:47,743 INFO L87 Difference]: Start difference. First operand 785 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:47:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:47,896 INFO L93 Difference]: Finished difference Result 1258 states and 4420 transitions. [2020-02-10 20:47:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:47,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:47,900 INFO L225 Difference]: With dead ends: 1258 [2020-02-10 20:47:47,900 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:47:47,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:47:47,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 775. [2020-02-10 20:47:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:47:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3103 transitions. [2020-02-10 20:47:47,924 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3103 transitions. Word has length 25 [2020-02-10 20:47:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:47,924 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3103 transitions. [2020-02-10 20:47:47,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:47,924 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3103 transitions. [2020-02-10 20:47:47,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:47,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:47,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-02-10 20:47:47,926 INFO L427 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-02-10 20:47:47,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:47,926 INFO L82 PathProgramCache]: Analyzing trace with hash -73889247, now seen corresponding path program 733 times [2020-02-10 20:47:47,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:47,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984184636] [2020-02-10 20:47:47,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:48,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984184636] [2020-02-10 20:47:48,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:48,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:48,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48999078] [2020-02-10 20:47:48,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:48,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:48,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:48,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:48,364 INFO L87 Difference]: Start difference. First operand 775 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:47:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:48,500 INFO L93 Difference]: Finished difference Result 1238 states and 4382 transitions. [2020-02-10 20:47:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:48,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:48,504 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:47:48,504 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 20:47:48,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-02-10 20:47:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 20:47:48,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 781. [2020-02-10 20:47:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:47:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-02-10 20:47:48,528 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-02-10 20:47:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:48,528 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-02-10 20:47:48,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:48,528 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-02-10 20:47:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:48,529 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:48,529 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:48,529 INFO L427 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-02-10 20:47:48,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:48,529 INFO L82 PathProgramCache]: Analyzing trace with hash 906865471, now seen corresponding path program 734 times [2020-02-10 20:47:48,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:48,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494889471] [2020-02-10 20:47:48,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:48,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494889471] [2020-02-10 20:47:48,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:48,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:48,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226078621] [2020-02-10 20:47:48,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:48,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:48,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:48,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:48,916 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:47:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:49,066 INFO L93 Difference]: Finished difference Result 1237 states and 4377 transitions. [2020-02-10 20:47:49,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:49,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:49,070 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 20:47:49,070 INFO L226 Difference]: Without dead ends: 1222 [2020-02-10 20:47:49,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-02-10 20:47:49,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 778. [2020-02-10 20:47:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:47:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3111 transitions. [2020-02-10 20:47:49,093 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3111 transitions. Word has length 25 [2020-02-10 20:47:49,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:49,094 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3111 transitions. [2020-02-10 20:47:49,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:49,094 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3111 transitions. [2020-02-10 20:47:49,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:49,095 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:49,095 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:49,095 INFO L427 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-02-10 20:47:49,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:49,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1852144831, now seen corresponding path program 735 times [2020-02-10 20:47:49,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:49,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648127437] [2020-02-10 20:47:49,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:49,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648127437] [2020-02-10 20:47:49,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:49,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:49,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901865112] [2020-02-10 20:47:49,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:49,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:49,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:49,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:49,484 INFO L87 Difference]: Start difference. First operand 778 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:47:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:49,624 INFO L93 Difference]: Finished difference Result 1243 states and 4390 transitions. [2020-02-10 20:47:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:49,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:49,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:49,627 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:47:49,627 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 20:47:49,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:49,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 20:47:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 782. [2020-02-10 20:47:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:47:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3118 transitions. [2020-02-10 20:47:49,650 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3118 transitions. Word has length 25 [2020-02-10 20:47:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:49,650 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3118 transitions. [2020-02-10 20:47:49,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3118 transitions. [2020-02-10 20:47:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:49,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:49,652 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:49,652 INFO L427 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-02-10 20:47:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:49,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1451564643, now seen corresponding path program 736 times [2020-02-10 20:47:49,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:49,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175675463] [2020-02-10 20:47:49,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:50,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175675463] [2020-02-10 20:47:50,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:50,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:50,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345927072] [2020-02-10 20:47:50,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:50,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:50,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:50,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:50,031 INFO L87 Difference]: Start difference. First operand 782 states and 3118 transitions. Second operand 10 states. [2020-02-10 20:47:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:50,186 INFO L93 Difference]: Finished difference Result 1246 states and 4392 transitions. [2020-02-10 20:47:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:50,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:50,189 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:47:50,190 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:47:50,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:47:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 778. [2020-02-10 20:47:50,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:47:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-02-10 20:47:50,213 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-02-10 20:47:50,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:50,213 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-02-10 20:47:50,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:50,213 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-02-10 20:47:50,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:50,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:50,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-02-10 20:47:50,214 INFO L427 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-02-10 20:47:50,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:50,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1571086881, now seen corresponding path program 737 times [2020-02-10 20:47:50,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:50,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488809846] [2020-02-10 20:47:50,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:50,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488809846] [2020-02-10 20:47:50,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:50,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:50,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810603954] [2020-02-10 20:47:50,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:50,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:50,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:50,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:50,608 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:47:50,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:50,762 INFO L93 Difference]: Finished difference Result 1240 states and 4380 transitions. [2020-02-10 20:47:50,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:50,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:50,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:50,765 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 20:47:50,766 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:47:50,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:47:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 781. [2020-02-10 20:47:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:47:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-02-10 20:47:50,789 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-02-10 20:47:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:50,789 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-02-10 20:47:50,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-02-10 20:47:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:50,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:50,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-02-10 20:47:50,790 INFO L427 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-02-10 20:47:50,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:50,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1112939457, now seen corresponding path program 738 times [2020-02-10 20:47:50,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:50,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871467026] [2020-02-10 20:47:50,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:51,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871467026] [2020-02-10 20:47:51,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:51,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:51,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717496178] [2020-02-10 20:47:51,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:51,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:51,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:51,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:51,174 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-02-10 20:47:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:51,332 INFO L93 Difference]: Finished difference Result 1244 states and 4385 transitions. [2020-02-10 20:47:51,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:51,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:51,336 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:47:51,336 INFO L226 Difference]: Without dead ends: 1222 [2020-02-10 20:47:51,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-02-10 20:47:51,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 775. [2020-02-10 20:47:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:47:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3100 transitions. [2020-02-10 20:47:51,359 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3100 transitions. Word has length 25 [2020-02-10 20:47:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:51,360 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3100 transitions. [2020-02-10 20:47:51,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3100 transitions. [2020-02-10 20:47:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:51,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:51,361 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:51,361 INFO L427 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-02-10 20:47:51,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:51,361 INFO L82 PathProgramCache]: Analyzing trace with hash -730047843, now seen corresponding path program 739 times [2020-02-10 20:47:51,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:51,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138277824] [2020-02-10 20:47:51,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:51,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138277824] [2020-02-10 20:47:51,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:51,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:51,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173009088] [2020-02-10 20:47:51,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:51,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:51,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:51,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:51,744 INFO L87 Difference]: Start difference. First operand 775 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:47:51,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:51,905 INFO L93 Difference]: Finished difference Result 1246 states and 4397 transitions. [2020-02-10 20:47:51,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:51,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:51,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:51,909 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:47:51,909 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 20:47:51,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 20:47:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 781. [2020-02-10 20:47:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:47:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 20:47:51,932 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 20:47:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:51,932 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 20:47:51,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 20:47:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:51,933 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:51,933 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:51,933 INFO L427 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-02-10 20:47:51,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:51,933 INFO L82 PathProgramCache]: Analyzing trace with hash 880893115, now seen corresponding path program 740 times [2020-02-10 20:47:51,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:51,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223515119] [2020-02-10 20:47:51,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:52,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223515119] [2020-02-10 20:47:52,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:52,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:52,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440654063] [2020-02-10 20:47:52,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:52,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:52,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:52,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:52,331 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:47:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:52,523 INFO L93 Difference]: Finished difference Result 1243 states and 4388 transitions. [2020-02-10 20:47:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:52,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:52,527 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:47:52,527 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:47:52,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:52,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:47:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 778. [2020-02-10 20:47:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:47:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-02-10 20:47:52,550 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-02-10 20:47:52,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:52,551 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-02-10 20:47:52,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-02-10 20:47:52,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:52,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:52,552 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:52,552 INFO L427 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-02-10 20:47:52,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:52,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1964481599, now seen corresponding path program 741 times [2020-02-10 20:47:52,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:52,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180914303] [2020-02-10 20:47:52,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:52,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-02-10 20:47:52,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180914303] [2020-02-10 20:47:52,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:52,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:52,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818141075] [2020-02-10 20:47:52,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:52,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:52,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:52,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:52,938 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:47:53,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:53,085 INFO L93 Difference]: Finished difference Result 1253 states and 4411 transitions. [2020-02-10 20:47:53,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:53,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:53,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:53,089 INFO L225 Difference]: With dead ends: 1253 [2020-02-10 20:47:53,089 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 20:47:53,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 20:47:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 784. [2020-02-10 20:47:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:47:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-02-10 20:47:53,113 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-02-10 20:47:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:53,113 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-02-10 20:47:53,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-02-10 20:47:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:53,114 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:53,114 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:53,114 INFO L427 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-02-10 20:47:53,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash 891396219, now seen corresponding path program 742 times [2020-02-10 20:47:53,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:53,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917669316] [2020-02-10 20:47:53,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:53,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917669316] [2020-02-10 20:47:53,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:53,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:53,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19172829] [2020-02-10 20:47:53,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:53,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:53,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:53,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:53,504 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:47:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:53,660 INFO L93 Difference]: Finished difference Result 1254 states and 4407 transitions. [2020-02-10 20:47:53,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:53,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:53,664 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 20:47:53,664 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:47:53,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:47:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 778. [2020-02-10 20:47:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:47:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 20:47:53,687 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 20:47:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:53,687 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 20:47:53,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 20:47:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:53,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:53,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:53,688 INFO L427 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-02-10 20:47:53,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:53,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1974984703, now seen corresponding path program 743 times [2020-02-10 20:47:53,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:53,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010253498] [2020-02-10 20:47:53,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:54,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010253498] [2020-02-10 20:47:54,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:54,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:54,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846769032] [2020-02-10 20:47:54,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:54,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:54,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:54,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:54,080 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:47:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:54,250 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-02-10 20:47:54,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:54,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:54,254 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:47:54,254 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:47:54,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:47:54,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-02-10 20:47:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:47:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:47:54,278 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:47:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:54,278 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:47:54,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:47:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:54,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:54,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-02-10 20:47:54,279 INFO L427 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-02-10 20:47:54,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:54,279 INFO L82 PathProgramCache]: Analyzing trace with hash -709041635, now seen corresponding path program 744 times [2020-02-10 20:47:54,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:54,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389417875] [2020-02-10 20:47:54,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:54,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389417875] [2020-02-10 20:47:54,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:54,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:54,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143816271] [2020-02-10 20:47:54,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:54,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:54,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:54,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:54,674 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:47:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:54,830 INFO L93 Difference]: Finished difference Result 1248 states and 4392 transitions. [2020-02-10 20:47:54,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:54,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:54,834 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 20:47:54,834 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 20:47:54,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 20:47:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 772. [2020-02-10 20:47:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-02-10 20:47:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3092 transitions. [2020-02-10 20:47:54,858 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3092 transitions. Word has length 25 [2020-02-10 20:47:54,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:54,858 INFO L479 AbstractCegarLoop]: Abstraction has 772 states and 3092 transitions. [2020-02-10 20:47:54,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3092 transitions. [2020-02-10 20:47:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:54,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:54,859 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:54,859 INFO L427 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-02-10 20:47:54,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:54,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1367107491, now seen corresponding path program 745 times [2020-02-10 20:47:54,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:54,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924497200] [2020-02-10 20:47:54,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:55,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924497200] [2020-02-10 20:47:55,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:55,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:55,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180296801] [2020-02-10 20:47:55,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:55,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:55,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:55,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:55,246 INFO L87 Difference]: Start difference. First operand 772 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:47:55,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:55,399 INFO L93 Difference]: Finished difference Result 1238 states and 4385 transitions. [2020-02-10 20:47:55,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:55,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:55,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:55,403 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:47:55,403 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 20:47:55,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 20:47:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 782. [2020-02-10 20:47:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:47:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3124 transitions. [2020-02-10 20:47:55,442 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3124 transitions. Word has length 25 [2020-02-10 20:47:55,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:55,442 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3124 transitions. [2020-02-10 20:47:55,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3124 transitions. [2020-02-10 20:47:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:55,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:55,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:55,443 INFO L427 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-02-10 20:47:55,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:55,443 INFO L82 PathProgramCache]: Analyzing trace with hash -396855877, now seen corresponding path program 746 times [2020-02-10 20:47:55,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:55,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369712334] [2020-02-10 20:47:55,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:55,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369712334] [2020-02-10 20:47:55,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:55,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:55,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969022664] [2020-02-10 20:47:55,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:55,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:55,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:55,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:55,831 INFO L87 Difference]: Start difference. First operand 782 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:47:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:55,980 INFO L93 Difference]: Finished difference Result 1240 states and 4385 transitions. [2020-02-10 20:47:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:55,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:55,984 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 20:47:55,984 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 20:47:55,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-02-10 20:47:55,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 20:47:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 778. [2020-02-10 20:47:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:47:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3114 transitions. [2020-02-10 20:47:56,008 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3114 transitions. Word has length 25 [2020-02-10 20:47:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:56,008 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3114 transitions. [2020-02-10 20:47:56,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3114 transitions. [2020-02-10 20:47:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:56,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47: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-02-10 20:47:56,009 INFO L427 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-02-10 20:47:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:56,009 INFO L82 PathProgramCache]: Analyzing trace with hash 558926587, now seen corresponding path program 747 times [2020-02-10 20:47:56,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:56,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804344041] [2020-02-10 20:47:56,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:56,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-02-10 20:47:56,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804344041] [2020-02-10 20:47:56,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:56,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:56,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136962308] [2020-02-10 20:47:56,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:56,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:56,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:56,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:56,416 INFO L87 Difference]: Start difference. First operand 778 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:47:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:56,599 INFO L93 Difference]: Finished difference Result 1234 states and 4373 transitions. [2020-02-10 20:47:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:56,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:56,603 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 20:47:56,603 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 20:47:56,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-02-10 20:47:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 20:47:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-02-10 20:47:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:47:56,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-02-10 20:47:56,627 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-02-10 20:47:56,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:56,627 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-02-10 20:47:56,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:56,627 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-02-10 20:47:56,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:56,628 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:56,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:56,628 INFO L427 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-02-10 20:47:56,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:56,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1539681305, now seen corresponding path program 748 times [2020-02-10 20:47:56,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:56,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043974643] [2020-02-10 20:47:56,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:57,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043974643] [2020-02-10 20:47:57,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:57,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:57,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360588257] [2020-02-10 20:47:57,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:57,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:57,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:57,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:57,021 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:47:57,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:57,173 INFO L93 Difference]: Finished difference Result 1233 states and 4368 transitions. [2020-02-10 20:47:57,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:57,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:57,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:57,177 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 20:47:57,177 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 20:47:57,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 20:47:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-02-10 20:47:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:47:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3111 transitions. [2020-02-10 20:47:57,201 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3111 transitions. Word has length 25 [2020-02-10 20:47:57,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:57,201 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3111 transitions. [2020-02-10 20:47:57,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:57,201 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3111 transitions. [2020-02-10 20:47:57,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:57,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:57,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-02-10 20:47:57,202 INFO L427 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-02-10 20:47:57,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:57,202 INFO L82 PathProgramCache]: Analyzing trace with hash -58230691, now seen corresponding path program 749 times [2020-02-10 20:47:57,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:57,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762210389] [2020-02-10 20:47:57,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:57,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762210389] [2020-02-10 20:47:57,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:57,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:57,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633164374] [2020-02-10 20:47:57,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:57,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:57,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:57,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:57,590 INFO L87 Difference]: Start difference. First operand 778 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:47:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:57,740 INFO L93 Difference]: Finished difference Result 1238 states and 4378 transitions. [2020-02-10 20:47:57,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:57,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:57,744 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:47:57,744 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 20:47:57,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-02-10 20:47:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 20:47:57,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 781. [2020-02-10 20:47:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:47:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 20:47:57,769 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 20:47:57,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:57,769 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 20:47:57,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:57,769 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 20:47:57,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:57,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:57,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-02-10 20:47:57,770 INFO L427 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-02-10 20:47:57,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:57,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1552710267, now seen corresponding path program 750 times [2020-02-10 20:47:57,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:57,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157980512] [2020-02-10 20:47:57,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:58,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157980512] [2020-02-10 20:47:58,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:58,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:58,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130363061] [2020-02-10 20:47:58,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:58,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:58,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:58,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:58,166 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:47:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:58,325 INFO L93 Difference]: Finished difference Result 1235 states and 4369 transitions. [2020-02-10 20:47:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:58,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:58,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:58,329 INFO L225 Difference]: With dead ends: 1235 [2020-02-10 20:47:58,329 INFO L226 Difference]: Without dead ends: 1217 [2020-02-10 20:47:58,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2020-02-10 20:47:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 775. [2020-02-10 20:47:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:47:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3103 transitions. [2020-02-10 20:47:58,353 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3103 transitions. Word has length 25 [2020-02-10 20:47:58,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:58,353 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3103 transitions. [2020-02-10 20:47:58,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3103 transitions. [2020-02-10 20:47:58,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:58,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:58,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-02-10 20:47:58,354 INFO L427 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-02-10 20:47:58,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:58,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2082888353, now seen corresponding path program 751 times [2020-02-10 20:47:58,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:58,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79964528] [2020-02-10 20:47:58,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:58,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79964528] [2020-02-10 20:47:58,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:58,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:58,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762199848] [2020-02-10 20:47:58,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:58,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:58,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:58,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:58,742 INFO L87 Difference]: Start difference. First operand 775 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:47:58,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:58,950 INFO L93 Difference]: Finished difference Result 1244 states and 4399 transitions. [2020-02-10 20:47:58,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:58,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:58,954 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:47:58,954 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 20:47:58,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:47:58,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 20:47:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 783. [2020-02-10 20:47:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:47:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3125 transitions. [2020-02-10 20:47:58,977 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3125 transitions. Word has length 25 [2020-02-10 20:47:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:58,977 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3125 transitions. [2020-02-10 20:47:58,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3125 transitions. [2020-02-10 20:47:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:58,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:58,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-02-10 20:47:58,979 INFO L427 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-02-10 20:47:58,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:58,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1241827329, now seen corresponding path program 752 times [2020-02-10 20:47:58,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:58,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094900973] [2020-02-10 20:47:58,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:47:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:47:59,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094900973] [2020-02-10 20:47:59,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:47:59,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:47:59,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533834213] [2020-02-10 20:47:59,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:47:59,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:47:59,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:47:59,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:47:59,407 INFO L87 Difference]: Start difference. First operand 783 states and 3125 transitions. Second operand 10 states. [2020-02-10 20:47:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:47:59,556 INFO L93 Difference]: Finished difference Result 1246 states and 4399 transitions. [2020-02-10 20:47:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:47:59,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:47:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:47:59,560 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:47:59,560 INFO L226 Difference]: Without dead ends: 1227 [2020-02-10 20:47:59,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-02-10 20:47:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2020-02-10 20:47:59,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 779. [2020-02-10 20:47:59,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:47:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3114 transitions. [2020-02-10 20:47:59,583 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3114 transitions. Word has length 25 [2020-02-10 20:47:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:47:59,583 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3114 transitions. [2020-02-10 20:47:59,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:47:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3114 transitions. [2020-02-10 20:47:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:47:59,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:47:59,585 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:47:59,585 INFO L427 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-02-10 20:47:59,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:47:59,585 INFO L82 PathProgramCache]: Analyzing trace with hash -728944005, now seen corresponding path program 753 times [2020-02-10 20:47:59,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:47:59,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611643135] [2020-02-10 20:47:59,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:47:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:00,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:00,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611643135] [2020-02-10 20:48:00,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:00,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:00,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561967752] [2020-02-10 20:48:00,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:00,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:00,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:00,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:00,014 INFO L87 Difference]: Start difference. First operand 779 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:48:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:00,165 INFO L93 Difference]: Finished difference Result 1243 states and 4393 transitions. [2020-02-10 20:48:00,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:00,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:00,168 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:48:00,169 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 20:48:00,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-02-10 20:48:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 20:48:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-02-10 20:48:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:48:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3121 transitions. [2020-02-10 20:48:00,191 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3121 transitions. Word has length 25 [2020-02-10 20:48:00,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:00,192 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3121 transitions. [2020-02-10 20:48:00,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:00,192 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3121 transitions. [2020-02-10 20:48:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:00,193 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:00,193 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:00,193 INFO L427 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-02-10 20:48:00,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:00,193 INFO L82 PathProgramCache]: Analyzing trace with hash 272816921, now seen corresponding path program 754 times [2020-02-10 20:48:00,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:00,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827786111] [2020-02-10 20:48:00,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:00,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827786111] [2020-02-10 20:48:00,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:00,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:00,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260992350] [2020-02-10 20:48:00,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:00,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:00,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:00,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:00,585 INFO L87 Difference]: Start difference. First operand 783 states and 3121 transitions. Second operand 10 states. [2020-02-10 20:48:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:00,740 INFO L93 Difference]: Finished difference Result 1244 states and 4391 transitions. [2020-02-10 20:48:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:00,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:00,743 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:48:00,744 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:48:00,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-02-10 20:48:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:48:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-02-10 20:48:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:48:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3110 transitions. [2020-02-10 20:48:00,767 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3110 transitions. Word has length 25 [2020-02-10 20:48:00,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:00,767 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3110 transitions. [2020-02-10 20:48:00,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3110 transitions. [2020-02-10 20:48:00,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:00,768 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:00,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-02-10 20:48:00,769 INFO L427 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-02-10 20:48:00,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:00,769 INFO L82 PathProgramCache]: Analyzing trace with hash -252009695, now seen corresponding path program 755 times [2020-02-10 20:48:00,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:00,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213384831] [2020-02-10 20:48:00,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48: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-02-10 20:48:01,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213384831] [2020-02-10 20:48:01,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:01,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:01,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54747558] [2020-02-10 20:48:01,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:01,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:01,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:01,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:01,162 INFO L87 Difference]: Start difference. First operand 779 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:48:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:01,316 INFO L93 Difference]: Finished difference Result 1248 states and 4400 transitions. [2020-02-10 20:48:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:01,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:01,319 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 20:48:01,319 INFO L226 Difference]: Without dead ends: 1233 [2020-02-10 20:48:01,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-02-10 20:48:01,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-02-10 20:48:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 784. [2020-02-10 20:48:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:48:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-02-10 20:48:01,343 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-02-10 20:48:01,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:01,343 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-02-10 20:48:01,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-02-10 20:48:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:01,344 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:01,344 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:01,344 INFO L427 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-02-10 20:48:01,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:01,344 INFO L82 PathProgramCache]: Analyzing trace with hash 285845883, now seen corresponding path program 756 times [2020-02-10 20:48:01,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:01,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457327423] [2020-02-10 20:48:01,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:01,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457327423] [2020-02-10 20:48:01,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:01,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:01,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228314572] [2020-02-10 20:48:01,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:01,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:01,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:01,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:01,740 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:48:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:01,894 INFO L93 Difference]: Finished difference Result 1247 states and 4393 transitions. [2020-02-10 20:48:01,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:01,895 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:01,898 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 20:48:01,898 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:48:01,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-02-10 20:48:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:48:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 775. [2020-02-10 20:48:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:48:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3100 transitions. [2020-02-10 20:48:01,922 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3100 transitions. Word has length 25 [2020-02-10 20:48:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:01,922 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3100 transitions. [2020-02-10 20:48:01,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:01,922 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3100 transitions. [2020-02-10 20:48:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:01,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:01,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-02-10 20:48:01,923 INFO L427 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-02-10 20:48:01,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:01,923 INFO L82 PathProgramCache]: Analyzing trace with hash -708530591, now seen corresponding path program 757 times [2020-02-10 20:48:01,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:01,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230308793] [2020-02-10 20:48:01,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:02,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230308793] [2020-02-10 20:48:02,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:02,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:02,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287696199] [2020-02-10 20:48:02,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:02,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:02,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:02,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:02,330 INFO L87 Difference]: Start difference. First operand 775 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:48:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:02,504 INFO L93 Difference]: Finished difference Result 1233 states and 4368 transitions. [2020-02-10 20:48:02,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:02,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:02,507 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 20:48:02,508 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 20:48:02,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-02-10 20:48:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 20:48:02,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 781. [2020-02-10 20:48:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 20:48:02,531 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 20:48:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:02,531 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 20:48:02,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:02,531 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 20:48:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:02,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:02,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-02-10 20:48:02,532 INFO L427 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-02-10 20:48:02,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:02,532 INFO L82 PathProgramCache]: Analyzing trace with hash 272224127, now seen corresponding path program 758 times [2020-02-10 20:48:02,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:02,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363239245] [2020-02-10 20:48:02,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:02,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363239245] [2020-02-10 20:48:02,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:02,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:02,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473651781] [2020-02-10 20:48:02,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:02,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:02,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:02,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:02,933 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:48:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:03,086 INFO L93 Difference]: Finished difference Result 1232 states and 4363 transitions. [2020-02-10 20:48:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:03,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:03,090 INFO L225 Difference]: With dead ends: 1232 [2020-02-10 20:48:03,090 INFO L226 Difference]: Without dead ends: 1217 [2020-02-10 20:48:03,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-02-10 20:48:03,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2020-02-10 20:48:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 778. [2020-02-10 20:48:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-02-10 20:48:03,114 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-02-10 20:48:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:03,114 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-02-10 20:48:03,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-02-10 20:48:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:03,115 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:03,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-02-10 20:48:03,115 INFO L427 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-02-10 20:48:03,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:03,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1151429731, now seen corresponding path program 759 times [2020-02-10 20:48:03,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:03,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112959157] [2020-02-10 20:48:03,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:03,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112959157] [2020-02-10 20:48:03,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:03,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:03,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761271371] [2020-02-10 20:48:03,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:03,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:03,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:03,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:03,511 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:48:03,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:03,650 INFO L93 Difference]: Finished difference Result 1236 states and 4372 transitions. [2020-02-10 20:48:03,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:03,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:03,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:03,653 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 20:48:03,653 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 20:48:03,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-02-10 20:48:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 20:48:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 782. [2020-02-10 20:48:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:48:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3115 transitions. [2020-02-10 20:48:03,676 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3115 transitions. Word has length 25 [2020-02-10 20:48:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:03,677 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3115 transitions. [2020-02-10 20:48:03,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3115 transitions. [2020-02-10 20:48:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:03,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:03,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-02-10 20:48:03,678 INFO L427 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-02-10 20:48:03,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:03,678 INFO L82 PathProgramCache]: Analyzing trace with hash -149668805, now seen corresponding path program 760 times [2020-02-10 20:48:03,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:03,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091278628] [2020-02-10 20:48:03,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:04,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091278628] [2020-02-10 20:48:04,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:04,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:04,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336120389] [2020-02-10 20:48:04,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:04,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:04,077 INFO L87 Difference]: Start difference. First operand 782 states and 3115 transitions. Second operand 10 states. [2020-02-10 20:48:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:04,220 INFO L93 Difference]: Finished difference Result 1237 states and 4370 transitions. [2020-02-10 20:48:04,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:04,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:04,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:04,223 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 20:48:04,223 INFO L226 Difference]: Without dead ends: 1219 [2020-02-10 20:48:04,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2020-02-10 20:48:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 778. [2020-02-10 20:48:04,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 20:48:04,246 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 20:48:04,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:04,246 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 20:48:04,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 20:48:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:04,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:04,248 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:04,248 INFO L427 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-02-10 20:48:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:04,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1262041761, now seen corresponding path program 761 times [2020-02-10 20:48:04,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:04,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190550793] [2020-02-10 20:48:04,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:04,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190550793] [2020-02-10 20:48:04,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:04,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:04,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25508540] [2020-02-10 20:48:04,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:04,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:04,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:04,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:04,639 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:48:04,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:04,780 INFO L93 Difference]: Finished difference Result 1233 states and 4362 transitions. [2020-02-10 20:48:04,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:04,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:04,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:04,783 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 20:48:04,783 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 20:48:04,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-02-10 20:48:04,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 20:48:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-02-10 20:48:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:48:04,806 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:48:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:04,806 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:48:04,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:48:04,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:04,807 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:04,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-02-10 20:48:04,807 INFO L427 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-02-10 20:48:04,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:04,808 INFO L82 PathProgramCache]: Analyzing trace with hash 188956381, now seen corresponding path program 762 times [2020-02-10 20:48:04,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:04,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186798924] [2020-02-10 20:48:04,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:05,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186798924] [2020-02-10 20:48:05,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:05,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:05,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627829012] [2020-02-10 20:48:05,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:05,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:05,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:05,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:05,218 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:48:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:05,364 INFO L93 Difference]: Finished difference Result 1235 states and 4363 transitions. [2020-02-10 20:48:05,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:05,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:05,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:05,367 INFO L225 Difference]: With dead ends: 1235 [2020-02-10 20:48:05,368 INFO L226 Difference]: Without dead ends: 1215 [2020-02-10 20:48:05,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-02-10 20:48:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2020-02-10 20:48:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 775. [2020-02-10 20:48:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:48:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-02-10 20:48:05,390 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-02-10 20:48:05,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:05,391 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-02-10 20:48:05,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:05,391 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-02-10 20:48:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:05,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:05,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-02-10 20:48:05,392 INFO L427 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-02-10 20:48:05,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:05,392 INFO L82 PathProgramCache]: Analyzing trace with hash 561344891, now seen corresponding path program 763 times [2020-02-10 20:48:05,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:05,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126607740] [2020-02-10 20:48:05,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:05,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126607740] [2020-02-10 20:48:05,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:05,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:05,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133461261] [2020-02-10 20:48:05,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:05,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:05,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:05,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:05,777 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:48:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:05,921 INFO L93 Difference]: Finished difference Result 1240 states and 4380 transitions. [2020-02-10 20:48:05,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:05,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:05,925 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 20:48:05,925 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 20:48:05,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-02-10 20:48:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 20:48:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 781. [2020-02-10 20:48:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-02-10 20:48:05,948 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-02-10 20:48:05,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:05,949 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-02-10 20:48:05,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-02-10 20:48:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:05,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:05,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-02-10 20:48:05,950 INFO L427 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-02-10 20:48:05,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:05,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2122681447, now seen corresponding path program 764 times [2020-02-10 20:48:05,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:05,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214542316] [2020-02-10 20:48:05,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:06,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214542316] [2020-02-10 20:48:06,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:06,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:06,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832285848] [2020-02-10 20:48:06,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:06,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:06,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:06,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:06,370 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-02-10 20:48:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:06,501 INFO L93 Difference]: Finished difference Result 1237 states and 4371 transitions. [2020-02-10 20:48:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:06,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:06,504 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 20:48:06,504 INFO L226 Difference]: Without dead ends: 1222 [2020-02-10 20:48:06,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-02-10 20:48:06,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-02-10 20:48:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 778. [2020-02-10 20:48:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 20:48:06,527 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 20:48:06,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:06,527 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 20:48:06,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 20:48:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:06,528 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48: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-02-10 20:48:06,528 INFO L427 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-02-10 20:48:06,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:06,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1655436479, now seen corresponding path program 765 times [2020-02-10 20:48:06,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:06,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213339539] [2020-02-10 20:48:06,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:06,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213339539] [2020-02-10 20:48:06,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:06,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:06,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055247052] [2020-02-10 20:48:06,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:06,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:06,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:06,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:06,918 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:48:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:07,052 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-02-10 20:48:07,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:07,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:07,056 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:48:07,056 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 20:48:07,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:07,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 20:48:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 783. [2020-02-10 20:48:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:48:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3114 transitions. [2020-02-10 20:48:07,079 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3114 transitions. Word has length 25 [2020-02-10 20:48:07,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:07,079 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3114 transitions. [2020-02-10 20:48:07,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:07,080 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3114 transitions. [2020-02-10 20:48:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:07,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:07,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-02-10 20:48:07,081 INFO L427 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-02-10 20:48:07,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:07,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2101675239, now seen corresponding path program 766 times [2020-02-10 20:48:07,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:07,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867101981] [2020-02-10 20:48:07,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:07,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867101981] [2020-02-10 20:48:07,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:07,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:07,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65989163] [2020-02-10 20:48:07,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:07,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:07,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:07,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:07,474 INFO L87 Difference]: Start difference. First operand 783 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:48:07,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:07,629 INFO L93 Difference]: Finished difference Result 1243 states and 4380 transitions. [2020-02-10 20:48:07,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:07,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:07,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:07,633 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:48:07,633 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:48:07,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-02-10 20:48:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:48:07,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-02-10 20:48:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 20:48:07,656 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 20:48:07,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:07,656 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 20:48:07,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:07,657 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 20:48:07,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:07,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:07,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-02-10 20:48:07,658 INFO L427 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-02-10 20:48:07,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:07,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1665939583, now seen corresponding path program 767 times [2020-02-10 20:48:07,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:07,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282394155] [2020-02-10 20:48:07,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:08,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282394155] [2020-02-10 20:48:08,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:08,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:08,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551421557] [2020-02-10 20:48:08,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:08,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:08,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:08,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:08,042 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:48:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:08,204 INFO L93 Difference]: Finished difference Result 1236 states and 4366 transitions. [2020-02-10 20:48:08,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:08,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:08,207 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 20:48:08,207 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:48:08,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-02-10 20:48:08,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:48:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 781. [2020-02-10 20:48:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 20:48:08,229 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 20:48:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:08,230 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 20:48:08,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 20:48:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:08,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:08,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-02-10 20:48:08,231 INFO L427 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-02-10 20:48:08,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:08,231 INFO L82 PathProgramCache]: Analyzing trace with hash 592854203, now seen corresponding path program 768 times [2020-02-10 20:48:08,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:08,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053667688] [2020-02-10 20:48:08,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:08,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053667688] [2020-02-10 20:48:08,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:08,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:08,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198784630] [2020-02-10 20:48:08,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:08,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:08,621 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:48:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:08,756 INFO L93 Difference]: Finished difference Result 1238 states and 4367 transitions. [2020-02-10 20:48:08,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:08,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:08,760 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:48:08,760 INFO L226 Difference]: Without dead ends: 1215 [2020-02-10 20:48:08,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2020-02-10 20:48:08,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 772. [2020-02-10 20:48:08,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-02-10 20:48:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3089 transitions. [2020-02-10 20:48:08,783 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3089 transitions. Word has length 25 [2020-02-10 20:48:08,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:08,783 INFO L479 AbstractCegarLoop]: Abstraction has 772 states and 3089 transitions. [2020-02-10 20:48:08,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:08,783 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3089 transitions. [2020-02-10 20:48:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:08,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:08,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:08,785 INFO L427 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-02-10 20:48:08,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:08,785 INFO L82 PathProgramCache]: Analyzing trace with hash -2001748835, now seen corresponding path program 769 times [2020-02-10 20:48:08,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:08,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730275766] [2020-02-10 20:48:08,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:09,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730275766] [2020-02-10 20:48:09,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:09,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:09,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493435969] [2020-02-10 20:48:09,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:09,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:09,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:09,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:09,167 INFO L87 Difference]: Start difference. First operand 772 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:48:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:09,325 INFO L93 Difference]: Finished difference Result 1262 states and 4453 transitions. [2020-02-10 20:48:09,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:09,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:09,329 INFO L225 Difference]: With dead ends: 1262 [2020-02-10 20:48:09,329 INFO L226 Difference]: Without dead ends: 1249 [2020-02-10 20:48:09,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-02-10 20:48:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2020-02-10 20:48:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 784. [2020-02-10 20:48:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:48:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3130 transitions. [2020-02-10 20:48:09,353 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3130 transitions. Word has length 25 [2020-02-10 20:48:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:09,353 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3130 transitions. [2020-02-10 20:48:09,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3130 transitions. [2020-02-10 20:48:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:09,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:09,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-02-10 20:48:09,355 INFO L427 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-02-10 20:48:09,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:09,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1031497221, now seen corresponding path program 770 times [2020-02-10 20:48:09,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:09,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558172916] [2020-02-10 20:48:09,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:09,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558172916] [2020-02-10 20:48:09,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:09,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:09,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200619386] [2020-02-10 20:48:09,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:09,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:09,740 INFO L87 Difference]: Start difference. First operand 784 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:48:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:09,888 INFO L93 Difference]: Finished difference Result 1264 states and 4453 transitions. [2020-02-10 20:48:09,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:09,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:09,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:09,892 INFO L225 Difference]: With dead ends: 1264 [2020-02-10 20:48:09,892 INFO L226 Difference]: Without dead ends: 1245 [2020-02-10 20:48:09,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2020-02-10 20:48:09,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 780. [2020-02-10 20:48:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:48:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3119 transitions. [2020-02-10 20:48:09,915 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3119 transitions. Word has length 25 [2020-02-10 20:48:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:09,915 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3119 transitions. [2020-02-10 20:48:09,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3119 transitions. [2020-02-10 20:48:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:09,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:09,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:09,916 INFO L427 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-02-10 20:48:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:09,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1850319321, now seen corresponding path program 771 times [2020-02-10 20:48:09,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:09,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4823109] [2020-02-10 20:48:09,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:10,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:10,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4823109] [2020-02-10 20:48:10,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:10,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:10,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796117234] [2020-02-10 20:48:10,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:10,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:10,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:10,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:10,307 INFO L87 Difference]: Start difference. First operand 780 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:48:10,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:10,450 INFO L93 Difference]: Finished difference Result 1263 states and 4451 transitions. [2020-02-10 20:48:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:10,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:10,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:10,454 INFO L225 Difference]: With dead ends: 1263 [2020-02-10 20:48:10,454 INFO L226 Difference]: Without dead ends: 1250 [2020-02-10 20:48:10,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-02-10 20:48:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-02-10 20:48:10,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 784. [2020-02-10 20:48:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:48:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3126 transitions. [2020-02-10 20:48:10,477 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3126 transitions. Word has length 25 [2020-02-10 20:48:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:10,477 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3126 transitions. [2020-02-10 20:48:10,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3126 transitions. [2020-02-10 20:48:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:10,478 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:10,478 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:10,478 INFO L427 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-02-10 20:48:10,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:10,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1453390153, now seen corresponding path program 772 times [2020-02-10 20:48:10,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:10,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718952692] [2020-02-10 20:48:10,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:10,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718952692] [2020-02-10 20:48:10,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:10,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:10,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406708756] [2020-02-10 20:48:10,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:10,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:10,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:10,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:10,882 INFO L87 Difference]: Start difference. First operand 784 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:48:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:11,026 INFO L93 Difference]: Finished difference Result 1266 states and 4453 transitions. [2020-02-10 20:48:11,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:11,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:11,029 INFO L225 Difference]: With dead ends: 1266 [2020-02-10 20:48:11,029 INFO L226 Difference]: Without dead ends: 1246 [2020-02-10 20:48:11,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-02-10 20:48:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-02-10 20:48:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 780. [2020-02-10 20:48:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:48:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3115 transitions. [2020-02-10 20:48:11,052 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3115 transitions. Word has length 25 [2020-02-10 20:48:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:11,052 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3115 transitions. [2020-02-10 20:48:11,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3115 transitions. [2020-02-10 20:48:11,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:11,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:11,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-02-10 20:48:11,054 INFO L427 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-02-10 20:48:11,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:11,054 INFO L82 PathProgramCache]: Analyzing trace with hash -367275811, now seen corresponding path program 773 times [2020-02-10 20:48:11,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:11,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872856580] [2020-02-10 20:48:11,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:11,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872856580] [2020-02-10 20:48:11,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:11,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:11,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904250595] [2020-02-10 20:48:11,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:11,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:11,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:11,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:11,455 INFO L87 Difference]: Start difference. First operand 780 states and 3115 transitions. Second operand 10 states. [2020-02-10 20:48:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:11,590 INFO L93 Difference]: Finished difference Result 1269 states and 4461 transitions. [2020-02-10 20:48:11,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:11,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:11,593 INFO L225 Difference]: With dead ends: 1269 [2020-02-10 20:48:11,593 INFO L226 Difference]: Without dead ends: 1254 [2020-02-10 20:48:11,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:11,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2020-02-10 20:48:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 786. [2020-02-10 20:48:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:48:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3126 transitions. [2020-02-10 20:48:11,616 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3126 transitions. Word has length 25 [2020-02-10 20:48:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:11,616 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3126 transitions. [2020-02-10 20:48:11,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3126 transitions. [2020-02-10 20:48:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:11,617 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:11,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:11,618 INFO L427 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-02-10 20:48:11,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:11,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1440361191, now seen corresponding path program 774 times [2020-02-10 20:48:11,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:11,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292878112] [2020-02-10 20:48:11,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48: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-02-10 20:48:12,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292878112] [2020-02-10 20:48:12,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:12,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:12,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238346253] [2020-02-10 20:48:12,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:12,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:12,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:12,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:12,012 INFO L87 Difference]: Start difference. First operand 786 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:48:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:12,149 INFO L93 Difference]: Finished difference Result 1270 states and 4457 transitions. [2020-02-10 20:48:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:12,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:12,153 INFO L225 Difference]: With dead ends: 1270 [2020-02-10 20:48:12,153 INFO L226 Difference]: Without dead ends: 1244 [2020-02-10 20:48:12,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-02-10 20:48:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 776. [2020-02-10 20:48:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:48:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3104 transitions. [2020-02-10 20:48:12,176 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3104 transitions. Word has length 25 [2020-02-10 20:48:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:12,177 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3104 transitions. [2020-02-10 20:48:12,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3104 transitions. [2020-02-10 20:48:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:12,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:12,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-02-10 20:48:12,178 INFO L427 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-02-10 20:48:12,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:12,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1870732735, now seen corresponding path program 775 times [2020-02-10 20:48:12,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:12,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204823709] [2020-02-10 20:48:12,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:12,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204823709] [2020-02-10 20:48:12,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:12,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:12,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183005460] [2020-02-10 20:48:12,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:12,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:12,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:12,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:12,569 INFO L87 Difference]: Start difference. First operand 776 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:48:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:12,704 INFO L93 Difference]: Finished difference Result 1259 states and 4442 transitions. [2020-02-10 20:48:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:12,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:12,708 INFO L225 Difference]: With dead ends: 1259 [2020-02-10 20:48:12,708 INFO L226 Difference]: Without dead ends: 1246 [2020-02-10 20:48:12,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-02-10 20:48:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 784. [2020-02-10 20:48:12,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:48:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3126 transitions. [2020-02-10 20:48:12,731 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3126 transitions. Word has length 25 [2020-02-10 20:48:12,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:12,732 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3126 transitions. [2020-02-10 20:48:12,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3126 transitions. [2020-02-10 20:48:12,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:12,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:12,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-02-10 20:48:12,733 INFO L427 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-02-10 20:48:12,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:12,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1453982947, now seen corresponding path program 776 times [2020-02-10 20:48:12,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:12,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376990177] [2020-02-10 20:48:12,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:13,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376990177] [2020-02-10 20:48:13,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:13,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:13,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629916157] [2020-02-10 20:48:13,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:13,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:13,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:13,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:13,127 INFO L87 Difference]: Start difference. First operand 784 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:48:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:13,288 INFO L93 Difference]: Finished difference Result 1261 states and 4442 transitions. [2020-02-10 20:48:13,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:13,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:13,292 INFO L225 Difference]: With dead ends: 1261 [2020-02-10 20:48:13,292 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 20:48:13,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-02-10 20:48:13,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 20:48:13,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-02-10 20:48:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:48:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3115 transitions. [2020-02-10 20:48:13,315 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3115 transitions. Word has length 25 [2020-02-10 20:48:13,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:13,315 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3115 transitions. [2020-02-10 20:48:13,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:13,315 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3115 transitions. [2020-02-10 20:48:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:13,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:13,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:13,316 INFO L427 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-02-10 20:48:13,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:13,316 INFO L82 PathProgramCache]: Analyzing trace with hash -941099623, now seen corresponding path program 777 times [2020-02-10 20:48:13,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:13,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138234923] [2020-02-10 20:48:13,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:13,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-02-10 20:48:13,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138234923] [2020-02-10 20:48:13,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:13,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:13,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892362398] [2020-02-10 20:48:13,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:13,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:13,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:13,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:13,722 INFO L87 Difference]: Start difference. First operand 780 states and 3115 transitions. Second operand 10 states. [2020-02-10 20:48:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:13,863 INFO L93 Difference]: Finished difference Result 1258 states and 4436 transitions. [2020-02-10 20:48:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:13,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:13,866 INFO L225 Difference]: With dead ends: 1258 [2020-02-10 20:48:13,866 INFO L226 Difference]: Without dead ends: 1245 [2020-02-10 20:48:13,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2020-02-10 20:48:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 784. [2020-02-10 20:48:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:48:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3122 transitions. [2020-02-10 20:48:13,890 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3122 transitions. Word has length 25 [2020-02-10 20:48:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:13,890 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3122 transitions. [2020-02-10 20:48:13,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3122 transitions. [2020-02-10 20:48:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:13,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48: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-02-10 20:48:13,891 INFO L427 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-02-10 20:48:13,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash 60661303, now seen corresponding path program 778 times [2020-02-10 20:48:13,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:13,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069894660] [2020-02-10 20:48:13,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:14,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069894660] [2020-02-10 20:48:14,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:14,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:14,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250932267] [2020-02-10 20:48:14,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:14,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:14,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:14,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:14,294 INFO L87 Difference]: Start difference. First operand 784 states and 3122 transitions. Second operand 10 states. [2020-02-10 20:48:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:14,438 INFO L93 Difference]: Finished difference Result 1259 states and 4434 transitions. [2020-02-10 20:48:14,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:14,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:14,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:14,441 INFO L225 Difference]: With dead ends: 1259 [2020-02-10 20:48:14,442 INFO L226 Difference]: Without dead ends: 1241 [2020-02-10 20:48:14,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2020-02-10 20:48:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 780. [2020-02-10 20:48:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:48:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 20:48:14,464 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 20:48:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:14,465 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 20:48:14,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 20:48:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:14,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:14,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-02-10 20:48:14,466 INFO L427 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-02-10 20:48:14,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:14,466 INFO L82 PathProgramCache]: Analyzing trace with hash -464165313, now seen corresponding path program 779 times [2020-02-10 20:48:14,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:14,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152367722] [2020-02-10 20:48:14,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:14,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152367722] [2020-02-10 20:48:14,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:14,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:14,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257115179] [2020-02-10 20:48:14,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:14,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:14,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:14,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:14,861 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:48:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:15,000 INFO L93 Difference]: Finished difference Result 1263 states and 4443 transitions. [2020-02-10 20:48:15,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:15,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:15,004 INFO L225 Difference]: With dead ends: 1263 [2020-02-10 20:48:15,004 INFO L226 Difference]: Without dead ends: 1248 [2020-02-10 20:48:15,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-02-10 20:48:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 785. [2020-02-10 20:48:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:48:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3120 transitions. [2020-02-10 20:48:15,027 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3120 transitions. Word has length 25 [2020-02-10 20:48:15,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:15,027 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3120 transitions. [2020-02-10 20:48:15,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:15,027 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3120 transitions. [2020-02-10 20:48:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:15,028 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:15,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:15,028 INFO L427 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-02-10 20:48:15,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:15,028 INFO L82 PathProgramCache]: Analyzing trace with hash 73690265, now seen corresponding path program 780 times [2020-02-10 20:48:15,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:15,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966324950] [2020-02-10 20:48:15,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:15,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966324950] [2020-02-10 20:48:15,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:15,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:15,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551362245] [2020-02-10 20:48:15,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:15,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:15,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:15,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:15,421 INFO L87 Difference]: Start difference. First operand 785 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:48:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:15,583 INFO L93 Difference]: Finished difference Result 1262 states and 4436 transitions. [2020-02-10 20:48:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:15,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:15,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:15,586 INFO L225 Difference]: With dead ends: 1262 [2020-02-10 20:48:15,586 INFO L226 Difference]: Without dead ends: 1239 [2020-02-10 20:48:15,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2020-02-10 20:48:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 776. [2020-02-10 20:48:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:48:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3100 transitions. [2020-02-10 20:48:15,610 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3100 transitions. Word has length 25 [2020-02-10 20:48:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:15,610 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3100 transitions. [2020-02-10 20:48:15,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3100 transitions. [2020-02-10 20:48:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:15,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48: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-02-10 20:48:15,611 INFO L427 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-02-10 20:48:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:15,611 INFO L82 PathProgramCache]: Analyzing trace with hash 582862143, now seen corresponding path program 781 times [2020-02-10 20:48:15,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:15,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505745159] [2020-02-10 20:48:15,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:15,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505745159] [2020-02-10 20:48:15,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:15,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:15,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662614465] [2020-02-10 20:48:15,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:15,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:15,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:15,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:15,998 INFO L87 Difference]: Start difference. First operand 776 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:48:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:16,150 INFO L93 Difference]: Finished difference Result 1261 states and 4442 transitions. [2020-02-10 20:48:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:16,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:16,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:16,153 INFO L225 Difference]: With dead ends: 1261 [2020-02-10 20:48:16,153 INFO L226 Difference]: Without dead ends: 1248 [2020-02-10 20:48:16,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:16,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-02-10 20:48:16,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 784. [2020-02-10 20:48:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:48:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3122 transitions. [2020-02-10 20:48:16,176 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3122 transitions. Word has length 25 [2020-02-10 20:48:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:16,176 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3122 transitions. [2020-02-10 20:48:16,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3122 transitions. [2020-02-10 20:48:16,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:16,177 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:16,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-02-10 20:48:16,178 INFO L427 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-02-10 20:48:16,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:16,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1574119965, now seen corresponding path program 782 times [2020-02-10 20:48:16,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:16,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818338727] [2020-02-10 20:48:16,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:16,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818338727] [2020-02-10 20:48:16,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:16,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:16,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964929939] [2020-02-10 20:48:16,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:16,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:16,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:16,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:16,565 INFO L87 Difference]: Start difference. First operand 784 states and 3122 transitions. Second operand 10 states. [2020-02-10 20:48:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:16,715 INFO L93 Difference]: Finished difference Result 1264 states and 4444 transitions. [2020-02-10 20:48:16,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:16,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:16,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:16,719 INFO L225 Difference]: With dead ends: 1264 [2020-02-10 20:48:16,719 INFO L226 Difference]: Without dead ends: 1244 [2020-02-10 20:48:16,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-02-10 20:48:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-02-10 20:48:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 780. [2020-02-10 20:48:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:48:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 20:48:16,742 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 20:48:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:16,743 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 20:48:16,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 20:48:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:16,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:16,744 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:16,744 INFO L427 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-02-10 20:48:16,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:16,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1786071075, now seen corresponding path program 783 times [2020-02-10 20:48:16,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:16,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095257055] [2020-02-10 20:48:16,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:17,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095257055] [2020-02-10 20:48:17,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:17,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:17,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54006580] [2020-02-10 20:48:17,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:17,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:17,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:17,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:17,137 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:48:17,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:17,274 INFO L93 Difference]: Finished difference Result 1259 states and 4434 transitions. [2020-02-10 20:48:17,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:17,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:17,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:17,278 INFO L225 Difference]: With dead ends: 1259 [2020-02-10 20:48:17,278 INFO L226 Difference]: Without dead ends: 1246 [2020-02-10 20:48:17,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-02-10 20:48:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-02-10 20:48:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 784. [2020-02-10 20:48:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:48:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3118 transitions. [2020-02-10 20:48:17,301 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3118 transitions. Word has length 25 [2020-02-10 20:48:17,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:17,301 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3118 transitions. [2020-02-10 20:48:17,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3118 transitions. [2020-02-10 20:48:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:17,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:17,303 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:17,303 INFO L427 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-02-10 20:48:17,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:17,303 INFO L82 PathProgramCache]: Analyzing trace with hash -784310149, now seen corresponding path program 784 times [2020-02-10 20:48:17,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:17,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730579315] [2020-02-10 20:48:17,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:17,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730579315] [2020-02-10 20:48:17,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:17,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:17,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344595464] [2020-02-10 20:48:17,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:17,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:17,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:17,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:17,695 INFO L87 Difference]: Start difference. First operand 784 states and 3118 transitions. Second operand 10 states. [2020-02-10 20:48:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:17,863 INFO L93 Difference]: Finished difference Result 1260 states and 4432 transitions. [2020-02-10 20:48:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:17,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:17,866 INFO L225 Difference]: With dead ends: 1260 [2020-02-10 20:48:17,866 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 20:48:17,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 20:48:17,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-02-10 20:48:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:48:17,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3107 transitions. [2020-02-10 20:48:17,889 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3107 transitions. Word has length 25 [2020-02-10 20:48:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:17,889 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3107 transitions. [2020-02-10 20:48:17,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3107 transitions. [2020-02-10 20:48:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:17,890 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:17,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-02-10 20:48:17,891 INFO L427 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-02-10 20:48:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:17,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1731029697, now seen corresponding path program 785 times [2020-02-10 20:48:17,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:17,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649744221] [2020-02-10 20:48:17,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:18,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649744221] [2020-02-10 20:48:18,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:18,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:18,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909155091] [2020-02-10 20:48:18,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:18,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:18,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:18,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:18,276 INFO L87 Difference]: Start difference. First operand 780 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:48:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:18,434 INFO L93 Difference]: Finished difference Result 1266 states and 4445 transitions. [2020-02-10 20:48:18,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:18,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:18,438 INFO L225 Difference]: With dead ends: 1266 [2020-02-10 20:48:18,438 INFO L226 Difference]: Without dead ends: 1250 [2020-02-10 20:48:18,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-02-10 20:48:18,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-02-10 20:48:18,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 785. [2020-02-10 20:48:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:48:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3116 transitions. [2020-02-10 20:48:18,470 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3116 transitions. Word has length 25 [2020-02-10 20:48:18,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:18,471 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3116 transitions. [2020-02-10 20:48:18,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3116 transitions. [2020-02-10 20:48:18,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:18,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:18,472 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:18,472 INFO L427 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-02-10 20:48:18,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:18,472 INFO L82 PathProgramCache]: Analyzing trace with hash -120088739, now seen corresponding path program 786 times [2020-02-10 20:48:18,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:18,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684268667] [2020-02-10 20:48:18,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:18,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-02-10 20:48:18,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684268667] [2020-02-10 20:48:18,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:18,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:18,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984047491] [2020-02-10 20:48:18,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:18,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:18,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:18,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:18,865 INFO L87 Difference]: Start difference. First operand 785 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:48:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:19,033 INFO L93 Difference]: Finished difference Result 1264 states and 4436 transitions. [2020-02-10 20:48:19,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:19,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:19,037 INFO L225 Difference]: With dead ends: 1264 [2020-02-10 20:48:19,037 INFO L226 Difference]: Without dead ends: 1241 [2020-02-10 20:48: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-02-10 20:48:19,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2020-02-10 20:48:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 776. [2020-02-10 20:48:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:48:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-02-10 20:48:19,061 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-02-10 20:48:19,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:19,061 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-02-10 20:48:19,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-02-10 20:48:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:19,062 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:19,062 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:19,062 INFO L427 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-02-10 20:48:19,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:19,062 INFO L82 PathProgramCache]: Analyzing trace with hash 252299771, now seen corresponding path program 787 times [2020-02-10 20:48:19,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:19,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024779168] [2020-02-10 20:48:19,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:19,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024779168] [2020-02-10 20:48:19,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:19,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:19,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271439513] [2020-02-10 20:48:19,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:19,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:19,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:19,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:19,467 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:48:19,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:19,632 INFO L93 Difference]: Finished difference Result 1273 states and 4469 transitions. [2020-02-10 20:48:19,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:19,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:19,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:19,636 INFO L225 Difference]: With dead ends: 1273 [2020-02-10 20:48:19,636 INFO L226 Difference]: Without dead ends: 1258 [2020-02-10 20:48:19,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2020-02-10 20:48:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 787. [2020-02-10 20:48:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:48:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3126 transitions. [2020-02-10 20:48:19,659 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3126 transitions. Word has length 25 [2020-02-10 20:48:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:19,660 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3126 transitions. [2020-02-10 20:48:19,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3126 transitions. [2020-02-10 20:48:19,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:19,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:19,661 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:19,661 INFO L427 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-02-10 20:48:19,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:19,661 INFO L82 PathProgramCache]: Analyzing trace with hash -820785609, now seen corresponding path program 788 times [2020-02-10 20:48:19,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:19,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787627487] [2020-02-10 20:48:19,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:20,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787627487] [2020-02-10 20:48:20,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:20,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:20,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267660610] [2020-02-10 20:48:20,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:20,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:20,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:20,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:20,059 INFO L87 Difference]: Start difference. First operand 787 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:48:20,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:20,202 INFO L93 Difference]: Finished difference Result 1274 states and 4465 transitions. [2020-02-10 20:48:20,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:20,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:20,206 INFO L225 Difference]: With dead ends: 1274 [2020-02-10 20:48:20,206 INFO L226 Difference]: Without dead ends: 1252 [2020-02-10 20:48:20,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-02-10 20:48:20,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2020-02-10 20:48:20,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 781. [2020-02-10 20:48:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:48:20,230 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:48:20,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:20,230 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:48:20,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:48:20,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:20,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:20,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-02-10 20:48:20,231 INFO L427 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-02-10 20:48:20,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:20,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1348138083, now seen corresponding path program 789 times [2020-02-10 20:48:20,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:20,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979917572] [2020-02-10 20:48:20,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:20,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979917572] [2020-02-10 20:48:20,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:20,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:20,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932247593] [2020-02-10 20:48:20,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:20,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:20,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:20,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:20,626 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:48:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:20,764 INFO L93 Difference]: Finished difference Result 1270 states and 4457 transitions. [2020-02-10 20:48:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:20,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:20,768 INFO L225 Difference]: With dead ends: 1270 [2020-02-10 20:48:20,768 INFO L226 Difference]: Without dead ends: 1255 [2020-02-10 20:48:20,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-02-10 20:48:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2020-02-10 20:48:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 786. [2020-02-10 20:48:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:48:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3119 transitions. [2020-02-10 20:48:20,802 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3119 transitions. Word has length 25 [2020-02-10 20:48:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:20,802 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3119 transitions. [2020-02-10 20:48:20,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3119 transitions. [2020-02-10 20:48:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:20,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:20,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:20,804 INFO L427 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-02-10 20:48:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:20,804 INFO L82 PathProgramCache]: Analyzing trace with hash -810282505, now seen corresponding path program 790 times [2020-02-10 20:48:20,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:20,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604970511] [2020-02-10 20:48:20,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:21,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604970511] [2020-02-10 20:48:21,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:21,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:21,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197610925] [2020-02-10 20:48:21,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:21,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:21,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:21,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:21,197 INFO L87 Difference]: Start difference. First operand 786 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:48:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:21,353 INFO L93 Difference]: Finished difference Result 1269 states and 4450 transitions. [2020-02-10 20:48:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:21,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:21,357 INFO L225 Difference]: With dead ends: 1269 [2020-02-10 20:48:21,357 INFO L226 Difference]: Without dead ends: 1250 [2020-02-10 20:48:21,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-02-10 20:48:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-02-10 20:48:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 781. [2020-02-10 20:48:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3105 transitions. [2020-02-10 20:48:21,381 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3105 transitions. Word has length 25 [2020-02-10 20:48:21,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:21,381 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3105 transitions. [2020-02-10 20:48:21,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3105 transitions. [2020-02-10 20:48:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:21,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:21,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-02-10 20:48:21,382 INFO L427 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-02-10 20:48:21,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:21,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1327131875, now seen corresponding path program 791 times [2020-02-10 20:48:21,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:21,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356123914] [2020-02-10 20:48:21,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:21,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356123914] [2020-02-10 20:48:21,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:21,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:21,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406340344] [2020-02-10 20:48:21,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:21,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:21,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:21,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:21,767 INFO L87 Difference]: Start difference. First operand 781 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:48:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:21,907 INFO L93 Difference]: Finished difference Result 1272 states and 4456 transitions. [2020-02-10 20:48:21,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:21,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:21,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:21,911 INFO L225 Difference]: With dead ends: 1272 [2020-02-10 20:48:21,911 INFO L226 Difference]: Without dead ends: 1256 [2020-02-10 20:48:21,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-02-10 20:48:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2020-02-10 20:48:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 786. [2020-02-10 20:48:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:48:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3114 transitions. [2020-02-10 20:48:21,935 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3114 transitions. Word has length 25 [2020-02-10 20:48:21,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:21,936 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3114 transitions. [2020-02-10 20:48:21,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3114 transitions. [2020-02-10 20:48:21,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:21,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:21,937 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:21,937 INFO L427 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-02-10 20:48:21,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:21,937 INFO L82 PathProgramCache]: Analyzing trace with hash 283809083, now seen corresponding path program 792 times [2020-02-10 20:48:21,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:21,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881292012] [2020-02-10 20:48:21,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:22,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881292012] [2020-02-10 20:48:22,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:22,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:22,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143334350] [2020-02-10 20:48:22,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:22,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:22,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:22,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:22,328 INFO L87 Difference]: Start difference. First operand 786 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:48:22,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:22,495 INFO L93 Difference]: Finished difference Result 1270 states and 4447 transitions. [2020-02-10 20:48:22,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:22,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:22,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:22,499 INFO L225 Difference]: With dead ends: 1270 [2020-02-10 20:48:22,499 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 20:48:22,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-02-10 20:48:22,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 20:48:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 772. [2020-02-10 20:48:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-02-10 20:48:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3086 transitions. [2020-02-10 20:48:22,522 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3086 transitions. Word has length 25 [2020-02-10 20:48:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:22,522 INFO L479 AbstractCegarLoop]: Abstraction has 772 states and 3086 transitions. [2020-02-10 20:48:22,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3086 transitions. [2020-02-10 20:48:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:22,523 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:22,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-02-10 20:48:22,524 INFO L427 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-02-10 20:48:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:22,524 INFO L82 PathProgramCache]: Analyzing trace with hash -710356101, now seen corresponding path program 793 times [2020-02-10 20:48:22,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:22,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954180873] [2020-02-10 20:48:22,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:22,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954180873] [2020-02-10 20:48:22,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:22,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:22,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503155193] [2020-02-10 20:48:22,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:22,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:22,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:22,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:22,912 INFO L87 Difference]: Start difference. First operand 772 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:48:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:23,069 INFO L93 Difference]: Finished difference Result 1236 states and 4374 transitions. [2020-02-10 20:48:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:23,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:23,073 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 20:48:23,073 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 20:48:23,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 20:48:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 781. [2020-02-10 20:48:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 20:48:23,097 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 20:48:23,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:23,097 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 20:48:23,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 20:48:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:23,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:23,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-02-10 20:48:23,098 INFO L427 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-02-10 20:48:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:23,099 INFO L82 PathProgramCache]: Analyzing trace with hash 270398617, now seen corresponding path program 794 times [2020-02-10 20:48:23,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:23,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266092331] [2020-02-10 20:48:23,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:23,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266092331] [2020-02-10 20:48:23,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:23,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:23,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585004149] [2020-02-10 20:48:23,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:23,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:23,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:23,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:23,484 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:48:23,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:23,644 INFO L93 Difference]: Finished difference Result 1235 states and 4369 transitions. [2020-02-10 20:48:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:23,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:23,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:23,648 INFO L225 Difference]: With dead ends: 1235 [2020-02-10 20:48:23,648 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 20:48:23,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-02-10 20:48:23,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 20:48:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-02-10 20:48:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-02-10 20:48:23,671 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-02-10 20:48:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:23,671 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-02-10 20:48:23,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-02-10 20:48:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:23,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:23,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-02-10 20:48:23,672 INFO L427 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-02-10 20:48:23,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:23,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1215677977, now seen corresponding path program 795 times [2020-02-10 20:48:23,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:23,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914175874] [2020-02-10 20:48:23,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:24,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914175874] [2020-02-10 20:48:24,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:24,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:24,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346525726] [2020-02-10 20:48:24,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:24,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:24,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:24,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:24,060 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:48:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:24,203 INFO L93 Difference]: Finished difference Result 1241 states and 4382 transitions. [2020-02-10 20:48:24,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:24,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:24,206 INFO L225 Difference]: With dead ends: 1241 [2020-02-10 20:48:24,206 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:48:24,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-02-10 20:48:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:48:24,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 782. [2020-02-10 20:48:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:48:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3115 transitions. [2020-02-10 20:48:24,229 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3115 transitions. Word has length 25 [2020-02-10 20:48:24,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:24,229 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3115 transitions. [2020-02-10 20:48:24,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3115 transitions. [2020-02-10 20:48:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:24,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:24,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:24,230 INFO L427 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-02-10 20:48:24,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash -2088031497, now seen corresponding path program 796 times [2020-02-10 20:48:24,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:24,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942340172] [2020-02-10 20:48:24,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:24,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942340172] [2020-02-10 20:48:24,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:24,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:24,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944366221] [2020-02-10 20:48:24,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:24,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:24,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:24,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:24,612 INFO L87 Difference]: Start difference. First operand 782 states and 3115 transitions. Second operand 10 states. [2020-02-10 20:48:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:24,749 INFO L93 Difference]: Finished difference Result 1244 states and 4384 transitions. [2020-02-10 20:48:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:24,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:24,752 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:48:24,752 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:48:24,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:48:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-02-10 20:48:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 20:48:24,775 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 20:48:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:24,775 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 20:48:24,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 20:48:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:24,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:24,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-02-10 20:48:24,776 INFO L427 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-02-10 20:48:24,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:24,777 INFO L82 PathProgramCache]: Analyzing trace with hash 934620027, now seen corresponding path program 797 times [2020-02-10 20:48:24,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:24,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477562884] [2020-02-10 20:48:24,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:25,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477562884] [2020-02-10 20:48:25,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:25,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:25,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194298507] [2020-02-10 20:48:25,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:25,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:25,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:25,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:25,170 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:48:25,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:25,328 INFO L93 Difference]: Finished difference Result 1238 states and 4372 transitions. [2020-02-10 20:48:25,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:25,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:25,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:25,332 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:48:25,332 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:48:25,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-02-10 20:48:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:48:25,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-02-10 20:48:25,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:48:25,355 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:48:25,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:25,355 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:48:25,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:48:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:25,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:25,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-02-10 20:48:25,357 INFO L427 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-02-10 20:48:25,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:25,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1749406311, now seen corresponding path program 798 times [2020-02-10 20:48:25,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:25,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540777148] [2020-02-10 20:48:25,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:25,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540777148] [2020-02-10 20:48:25,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:25,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:25,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274079556] [2020-02-10 20:48:25,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:25,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:25,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:25,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:25,734 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:48:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:25,900 INFO L93 Difference]: Finished difference Result 1242 states and 4377 transitions. [2020-02-10 20:48:25,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:25,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:25,904 INFO L225 Difference]: With dead ends: 1242 [2020-02-10 20:48:25,904 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 20:48:25,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-02-10 20:48:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 20:48:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 775. [2020-02-10 20:48:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:48:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-02-10 20:48:25,927 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-02-10 20:48:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:25,927 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-02-10 20:48:25,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-02-10 20:48:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:25,928 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:25,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-02-10 20:48:25,928 INFO L427 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-02-10 20:48:25,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:25,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1132841827, now seen corresponding path program 799 times [2020-02-10 20:48:25,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:25,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848629086] [2020-02-10 20:48:25,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:26,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848629086] [2020-02-10 20:48:26,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:26,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:26,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159828597] [2020-02-10 20:48:26,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:26,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:26,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:26,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:26,317 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:48:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:26,481 INFO L93 Difference]: Finished difference Result 1234 states and 4367 transitions. [2020-02-10 20:48:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:26,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:26,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:26,484 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 20:48:26,484 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 20:48:26,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 20:48:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-02-10 20:48:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-02-10 20:48:26,507 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-02-10 20:48:26,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:26,507 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-02-10 20:48:26,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-02-10 20:48:26,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:26,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:26,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:26,508 INFO L427 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-02-10 20:48:26,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:26,508 INFO L82 PathProgramCache]: Analyzing trace with hash -152087109, now seen corresponding path program 800 times [2020-02-10 20:48:26,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:26,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829452870] [2020-02-10 20:48:26,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:26,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829452870] [2020-02-10 20:48:26,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:26,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:26,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50359431] [2020-02-10 20:48:26,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:26,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:26,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:26,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:26,900 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-02-10 20:48:27,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:27,065 INFO L93 Difference]: Finished difference Result 1233 states and 4362 transitions. [2020-02-10 20:48:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:27,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:27,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:27,069 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 20:48:27,069 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 20:48:27,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:27,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 20:48:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-02-10 20:48:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 20:48:27,092 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 20:48:27,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:27,092 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 20:48:27,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 20:48:27,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:27,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:27,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-02-10 20:48:27,094 INFO L427 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-02-10 20:48:27,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:27,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1575740967, now seen corresponding path program 801 times [2020-02-10 20:48:27,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:27,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914402901] [2020-02-10 20:48:27,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:27,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914402901] [2020-02-10 20:48:27,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:27,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:27,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921061635] [2020-02-10 20:48:27,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:27,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:27,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:27,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:27,502 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:48:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:27,656 INFO L93 Difference]: Finished difference Result 1237 states and 4371 transitions. [2020-02-10 20:48:27,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:27,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:27,659 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 20:48:27,660 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:48:27,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:27,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:48:27,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 782. [2020-02-10 20:48:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:48:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3112 transitions. [2020-02-10 20:48:27,683 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3112 transitions. Word has length 25 [2020-02-10 20:48:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:27,683 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3112 transitions. [2020-02-10 20:48:27,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:27,683 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3112 transitions. [2020-02-10 20:48:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:27,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:27,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-02-10 20:48:27,684 INFO L427 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-02-10 20:48:27,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash -573980041, now seen corresponding path program 802 times [2020-02-10 20:48:27,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:27,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441287449] [2020-02-10 20:48:27,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:28,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441287449] [2020-02-10 20:48:28,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:28,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:28,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837092171] [2020-02-10 20:48:28,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:28,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:28,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:28,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:28,076 INFO L87 Difference]: Start difference. First operand 782 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:48:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:28,225 INFO L93 Difference]: Finished difference Result 1238 states and 4369 transitions. [2020-02-10 20:48:28,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:28,226 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:28,229 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:48:28,229 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 20:48:28,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 20:48:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-02-10 20:48:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 20:48:28,252 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 20:48:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:28,252 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 20:48:28,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:28,253 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 20:48:28,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:28,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48: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-02-10 20:48:28,254 INFO L427 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-02-10 20:48:28,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:28,254 INFO L82 PathProgramCache]: Analyzing trace with hash 837730525, now seen corresponding path program 803 times [2020-02-10 20:48:28,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:28,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760079535] [2020-02-10 20:48:28,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:28,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760079535] [2020-02-10 20:48:28,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:28,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:28,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447959402] [2020-02-10 20:48:28,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:28,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:28,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:28,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:28,648 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:48:28,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:28,810 INFO L93 Difference]: Finished difference Result 1234 states and 4361 transitions. [2020-02-10 20:48:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:28,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:28,814 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 20:48:28,814 INFO L226 Difference]: Without dead ends: 1222 [2020-02-10 20:48:28,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-02-10 20:48:28,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 781. [2020-02-10 20:48:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 20:48:28,838 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 20:48:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:28,838 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 20:48:28,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 20:48:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:28,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:28,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:28,839 INFO L427 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-02-10 20:48:28,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:28,839 INFO L82 PathProgramCache]: Analyzing trace with hash -235354855, now seen corresponding path program 804 times [2020-02-10 20:48:28,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:28,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940997128] [2020-02-10 20:48:28,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:29,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940997128] [2020-02-10 20:48:29,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:29,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:29,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884491765] [2020-02-10 20:48:29,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:29,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:29,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:29,233 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:48:29,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:29,369 INFO L93 Difference]: Finished difference Result 1236 states and 4362 transitions. [2020-02-10 20:48:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:29,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:29,372 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 20:48:29,372 INFO L226 Difference]: Without dead ends: 1216 [2020-02-10 20:48:29,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:29,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2020-02-10 20:48:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 775. [2020-02-10 20:48:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:48:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-02-10 20:48:29,395 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-02-10 20:48:29,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:29,395 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-02-10 20:48:29,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-02-10 20:48:29,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:29,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:29,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:29,396 INFO L427 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-02-10 20:48:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:29,396 INFO L82 PathProgramCache]: Analyzing trace with hash 370706525, now seen corresponding path program 805 times [2020-02-10 20:48:29,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:29,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256216468] [2020-02-10 20:48:29,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:29,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256216468] [2020-02-10 20:48:29,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:29,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:29,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406493273] [2020-02-10 20:48:29,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:29,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:29,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:29,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:29,777 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:48:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:29,925 INFO L93 Difference]: Finished difference Result 1247 states and 4396 transitions. [2020-02-10 20:48:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:29,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:29,928 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 20:48:29,928 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 20:48:29,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 20:48:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 783. [2020-02-10 20:48:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:48:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-02-10 20:48:29,951 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-02-10 20:48:29,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:29,951 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-02-10 20:48:29,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-02-10 20:48:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:29,952 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:29,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-02-10 20:48:29,953 INFO L427 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-02-10 20:48:29,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:29,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1361964347, now seen corresponding path program 806 times [2020-02-10 20:48:29,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:29,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929924623] [2020-02-10 20:48:29,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:30,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929924623] [2020-02-10 20:48:30,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:30,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:30,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840907292] [2020-02-10 20:48:30,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:30,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:30,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:30,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:30,333 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:48:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:30,492 INFO L93 Difference]: Finished difference Result 1250 states and 4398 transitions. [2020-02-10 20:48:30,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:30,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:30,496 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:48:30,496 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 20:48:30,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:30,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 20:48:30,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 779. [2020-02-10 20:48:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:48:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-02-10 20:48:30,519 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-02-10 20:48:30,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:30,520 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-02-10 20:48:30,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-02-10 20:48:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:30,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:30,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-02-10 20:48:30,521 INFO L427 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-02-10 20:48:30,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:30,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1998226693, now seen corresponding path program 807 times [2020-02-10 20:48:30,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:30,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261514291] [2020-02-10 20:48:30,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:30,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261514291] [2020-02-10 20:48:30,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:30,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:30,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691922785] [2020-02-10 20:48:30,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:30,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:30,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:30,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:30,916 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:48:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:31,077 INFO L93 Difference]: Finished difference Result 1245 states and 4388 transitions. [2020-02-10 20:48:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:31,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:31,081 INFO L225 Difference]: With dead ends: 1245 [2020-02-10 20:48:31,081 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:48:31,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-02-10 20:48:31,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:48:31,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-02-10 20:48:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:48:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-02-10 20:48:31,104 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-02-10 20:48:31,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:31,104 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-02-10 20:48:31,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-02-10 20:48:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:31,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:31,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-02-10 20:48:31,105 INFO L427 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-02-10 20:48:31,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:31,106 INFO L82 PathProgramCache]: Analyzing trace with hash -996465767, now seen corresponding path program 808 times [2020-02-10 20:48:31,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:31,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103557773] [2020-02-10 20:48:31,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:31,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103557773] [2020-02-10 20:48:31,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:31,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:31,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496257828] [2020-02-10 20:48:31,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:31,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:31,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:31,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:31,490 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:48:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:31,639 INFO L93 Difference]: Finished difference Result 1246 states and 4386 transitions. [2020-02-10 20:48:31,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:31,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:31,643 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:48:31,643 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:48:31,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-02-10 20:48:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:48:31,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 779. [2020-02-10 20:48:31,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:48:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3101 transitions. [2020-02-10 20:48:31,666 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3101 transitions. Word has length 25 [2020-02-10 20:48:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:31,666 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3101 transitions. [2020-02-10 20:48:31,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3101 transitions. [2020-02-10 20:48:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:31,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:31,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-02-10 20:48:31,668 INFO L427 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-02-10 20:48:31,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:31,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1943185315, now seen corresponding path program 809 times [2020-02-10 20:48:31,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:31,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791767655] [2020-02-10 20:48:31,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:32,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791767655] [2020-02-10 20:48:32,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:32,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:32,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356229006] [2020-02-10 20:48:32,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:32,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:32,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:32,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:32,056 INFO L87 Difference]: Start difference. First operand 779 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:48:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:32,205 INFO L93 Difference]: Finished difference Result 1252 states and 4399 transitions. [2020-02-10 20:48:32,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:32,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:32,208 INFO L225 Difference]: With dead ends: 1252 [2020-02-10 20:48:32,208 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 20:48:32,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:32,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 20:48:32,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 784. [2020-02-10 20:48:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:48:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3110 transitions. [2020-02-10 20:48:32,231 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3110 transitions. Word has length 25 [2020-02-10 20:48:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:32,231 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3110 transitions. [2020-02-10 20:48:32,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3110 transitions. [2020-02-10 20:48:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:32,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:32,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-02-10 20:48:32,232 INFO L427 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-02-10 20:48:32,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:32,233 INFO L82 PathProgramCache]: Analyzing trace with hash -332244357, now seen corresponding path program 810 times [2020-02-10 20:48:32,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:32,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699485609] [2020-02-10 20:48:32,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:32,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699485609] [2020-02-10 20:48:32,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:32,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:32,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646581832] [2020-02-10 20:48:32,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:32,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:32,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:32,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:32,618 INFO L87 Difference]: Start difference. First operand 784 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:48:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:32,771 INFO L93 Difference]: Finished difference Result 1250 states and 4390 transitions. [2020-02-10 20:48:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:32,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:32,775 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:48:32,775 INFO L226 Difference]: Without dead ends: 1227 [2020-02-10 20:48:32,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-02-10 20:48:32,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2020-02-10 20:48:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 775. [2020-02-10 20:48:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:48:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:48:32,807 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:48:32,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:32,807 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:48:32,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:32,807 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:48:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:32,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:32,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-02-10 20:48:32,808 INFO L427 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-02-10 20:48:32,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:32,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1554195609, now seen corresponding path program 811 times [2020-02-10 20:48:32,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:32,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612836057] [2020-02-10 20:48:32,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:33,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-02-10 20:48:33,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612836057] [2020-02-10 20:48:33,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:33,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:33,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822303514] [2020-02-10 20:48:33,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:33,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:33,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:33,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:33,178 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:48:33,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:33,320 INFO L93 Difference]: Finished difference Result 1240 states and 4374 transitions. [2020-02-10 20:48:33,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:33,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:33,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:33,323 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 20:48:33,323 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:48:33,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-02-10 20:48:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:48:33,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 781. [2020-02-10 20:48:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 20:48:33,346 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 20:48:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:33,346 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 20:48:33,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:33,346 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 20:48:33,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:33,347 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:33,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-02-10 20:48:33,347 INFO L427 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-02-10 20:48:33,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:33,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1129830729, now seen corresponding path program 812 times [2020-02-10 20:48:33,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:33,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411586063] [2020-02-10 20:48:33,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:33,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411586063] [2020-02-10 20:48:33,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:33,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:33,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780705038] [2020-02-10 20:48:33,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:33,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:33,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:33,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:33,728 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:48:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:33,894 INFO L93 Difference]: Finished difference Result 1244 states and 4379 transitions. [2020-02-10 20:48:33,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:33,895 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:33,898 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:48:33,898 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 20:48:33,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-02-10 20:48:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 20:48:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 778. [2020-02-10 20:48:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3099 transitions. [2020-02-10 20:48:33,921 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3099 transitions. Word has length 25 [2020-02-10 20:48:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:33,922 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3099 transitions. [2020-02-10 20:48:33,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3099 transitions. [2020-02-10 20:48:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:33,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:33,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-02-10 20:48:33,923 INFO L427 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-02-10 20:48:33,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:33,923 INFO L82 PathProgramCache]: Analyzing trace with hash -46242245, now seen corresponding path program 813 times [2020-02-10 20:48:33,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:33,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176599812] [2020-02-10 20:48:33,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:34,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-02-10 20:48:34,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176599812] [2020-02-10 20:48:34,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:34,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:34,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116598075] [2020-02-10 20:48:34,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:34,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:34,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:34,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:34,301 INFO L87 Difference]: Start difference. First operand 778 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:48:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:34,468 INFO L93 Difference]: Finished difference Result 1238 states and 4367 transitions. [2020-02-10 20:48:34,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:34,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:34,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:34,471 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:48:34,471 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:48:34,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:34,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:48:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-02-10 20:48:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 20:48:34,504 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 20:48:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:34,504 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 20:48:34,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 20:48:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:34,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:34,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-02-10 20:48:34,506 INFO L427 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-02-10 20:48:34,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:34,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1119327625, now seen corresponding path program 814 times [2020-02-10 20:48:34,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:34,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078269589] [2020-02-10 20:48:34,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:34,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-02-10 20:48:34,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078269589] [2020-02-10 20:48:34,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:34,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:34,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781108662] [2020-02-10 20:48:34,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:34,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:34,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:34,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:34,880 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:48:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:35,050 INFO L93 Difference]: Finished difference Result 1240 states and 4368 transitions. [2020-02-10 20:48:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:35,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:35,053 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 20:48:35,054 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 20:48:35,054 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:35,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 20:48:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 778. [2020-02-10 20:48:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 20:48:35,077 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 20:48:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:35,077 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 20:48:35,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 20:48:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:35,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:35,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-02-10 20:48:35,078 INFO L427 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-02-10 20:48:35,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash -35739141, now seen corresponding path program 815 times [2020-02-10 20:48:35,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:35,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266341940] [2020-02-10 20:48:35,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:35,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-02-10 20:48:35,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266341940] [2020-02-10 20:48:35,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:35,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:35,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870149520] [2020-02-10 20:48:35,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:35,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:35,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:35,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:35,447 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:48:35,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:35,615 INFO L93 Difference]: Finished difference Result 1248 states and 4386 transitions. [2020-02-10 20:48:35,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:35,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:35,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:35,618 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 20:48:35,618 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:48:35,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-02-10 20:48:35,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:48:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-02-10 20:48:35,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:48:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3105 transitions. [2020-02-10 20:48:35,641 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3105 transitions. Word has length 25 [2020-02-10 20:48:35,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:35,641 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3105 transitions. [2020-02-10 20:48:35,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:35,641 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3105 transitions. [2020-02-10 20:48:35,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:35,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:35,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-02-10 20:48:35,643 INFO L427 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-02-10 20:48:35,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:35,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1575201817, now seen corresponding path program 816 times [2020-02-10 20:48:35,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:35,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222052322] [2020-02-10 20:48:35,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:36,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222052322] [2020-02-10 20:48:36,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:36,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:36,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64017874] [2020-02-10 20:48:36,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:36,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:36,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:36,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:36,015 INFO L87 Difference]: Start difference. First operand 783 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:48:36,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:36,202 INFO L93 Difference]: Finished difference Result 1246 states and 4377 transitions. [2020-02-10 20:48:36,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:36,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:36,206 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:48:36,206 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 20:48:36,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-02-10 20:48:36,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 20:48:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 772. [2020-02-10 20:48:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-02-10 20:48:36,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3083 transitions. [2020-02-10 20:48:36,228 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3083 transitions. Word has length 25 [2020-02-10 20:48:36,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:36,228 INFO L479 AbstractCegarLoop]: Abstraction has 772 states and 3083 transitions. [2020-02-10 20:48:36,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:36,229 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3083 transitions. [2020-02-10 20:48:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:36,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:36,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:36,230 INFO L427 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-02-10 20:48:36,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:36,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1296926015, now seen corresponding path program 817 times [2020-02-10 20:48:36,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:36,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476516158] [2020-02-10 20:48:36,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:36,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476516158] [2020-02-10 20:48:36,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:36,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:36,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227805366] [2020-02-10 20:48:36,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:36,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:36,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:36,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:36,609 INFO L87 Difference]: Start difference. First operand 772 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:48:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:36,776 INFO L93 Difference]: Finished difference Result 1250 states and 4406 transitions. [2020-02-10 20:48:36,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:36,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:36,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:36,780 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:48:36,780 INFO L226 Difference]: Without dead ends: 1235 [2020-02-10 20:48:36,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2020-02-10 20:48:36,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 781. [2020-02-10 20:48:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-02-10 20:48:36,803 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-02-10 20:48:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:36,803 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-02-10 20:48:36,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-02-10 20:48:36,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:36,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:36,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-02-10 20:48:36,805 INFO L427 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-02-10 20:48:36,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:36,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1387100323, now seen corresponding path program 818 times [2020-02-10 20:48:36,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:36,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251695022] [2020-02-10 20:48:36,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:37,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:37,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251695022] [2020-02-10 20:48:37,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:37,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:37,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464642464] [2020-02-10 20:48:37,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:37,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:37,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:37,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:37,186 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-02-10 20:48:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:37,325 INFO L93 Difference]: Finished difference Result 1247 states and 4397 transitions. [2020-02-10 20:48:37,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:37,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:37,328 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 20:48:37,329 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:48:37,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:48:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 778. [2020-02-10 20:48:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 20:48:37,351 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 20:48:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:37,352 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 20:48:37,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 20:48:37,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:37,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:37,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-02-10 20:48:37,353 INFO L427 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-02-10 20:48:37,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:37,353 INFO L82 PathProgramCache]: Analyzing trace with hash -303511839, now seen corresponding path program 819 times [2020-02-10 20:48:37,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:37,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483799181] [2020-02-10 20:48:37,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:37,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483799181] [2020-02-10 20:48:37,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:37,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:37,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102365478] [2020-02-10 20:48:37,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:37,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:37,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:37,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:37,746 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:48:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:37,881 INFO L93 Difference]: Finished difference Result 1257 states and 4420 transitions. [2020-02-10 20:48:37,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:37,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:37,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:37,884 INFO L225 Difference]: With dead ends: 1257 [2020-02-10 20:48:37,885 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 20:48:37,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-02-10 20:48:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 20:48:37,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 784. [2020-02-10 20:48:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:48:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3116 transitions. [2020-02-10 20:48:37,908 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3116 transitions. Word has length 25 [2020-02-10 20:48:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:37,908 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3116 transitions. [2020-02-10 20:48:37,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3116 transitions. [2020-02-10 20:48:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:37,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:37,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-02-10 20:48:37,909 INFO L427 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-02-10 20:48:37,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:37,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1376597219, now seen corresponding path program 820 times [2020-02-10 20:48:37,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:37,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652903804] [2020-02-10 20:48:37,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:38,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652903804] [2020-02-10 20:48:38,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:38,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:38,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497804801] [2020-02-10 20:48:38,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:38,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:38,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:38,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:38,294 INFO L87 Difference]: Start difference. First operand 784 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:48:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:38,457 INFO L93 Difference]: Finished difference Result 1258 states and 4416 transitions. [2020-02-10 20:48:38,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:38,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:38,461 INFO L225 Difference]: With dead ends: 1258 [2020-02-10 20:48:38,461 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 20:48:38,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-02-10 20:48:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 20:48:38,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 778. [2020-02-10 20:48:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 20:48:38,485 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 20:48:38,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:38,485 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 20:48:38,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 20:48:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:38,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:38,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-02-10 20:48:38,486 INFO L427 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-02-10 20:48:38,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:38,487 INFO L82 PathProgramCache]: Analyzing trace with hash -293008735, now seen corresponding path program 821 times [2020-02-10 20:48:38,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:38,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883018673] [2020-02-10 20:48:38,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:38,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883018673] [2020-02-10 20:48:38,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:38,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:38,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451663295] [2020-02-10 20:48:38,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:38,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:38,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:38,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:38,876 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:48:39,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:39,019 INFO L93 Difference]: Finished difference Result 1248 states and 4396 transitions. [2020-02-10 20:48:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:39,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:39,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:39,022 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 20:48:39,022 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 20:48:39,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:39,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 20:48:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 781. [2020-02-10 20:48:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 20:48:39,045 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 20:48:39,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:39,045 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 20:48:39,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 20:48:39,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:39,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:39,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-02-10 20:48:39,046 INFO L427 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-02-10 20:48:39,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:39,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1317932223, now seen corresponding path program 822 times [2020-02-10 20:48:39,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:39,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426460932] [2020-02-10 20:48:39,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:39,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426460932] [2020-02-10 20:48:39,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:39,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:39,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902863944] [2020-02-10 20:48:39,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:39,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:39,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:39,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:39,444 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:48:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:39,609 INFO L93 Difference]: Finished difference Result 1252 states and 4401 transitions. [2020-02-10 20:48:39,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:39,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:39,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:39,613 INFO L225 Difference]: With dead ends: 1252 [2020-02-10 20:48:39,613 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 20:48:39,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 20:48:39,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 775. [2020-02-10 20:48:39,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:48:39,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-02-10 20:48:39,636 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-02-10 20:48:39,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:39,637 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-02-10 20:48:39,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:39,637 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-02-10 20:48:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:39,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:39,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-02-10 20:48:39,638 INFO L427 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-02-10 20:48:39,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:39,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1072007203, now seen corresponding path program 823 times [2020-02-10 20:48:39,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:39,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049137900] [2020-02-10 20:48:39,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:40,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049137900] [2020-02-10 20:48:40,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:40,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:40,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140438754] [2020-02-10 20:48:40,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:40,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:40,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:40,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:40,021 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:48:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:40,165 INFO L93 Difference]: Finished difference Result 1247 states and 4396 transitions. [2020-02-10 20:48:40,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:40,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:40,169 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 20:48:40,169 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:48:40,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-02-10 20:48:40,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:48:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-02-10 20:48:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:48:40,192 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:48:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:40,192 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:48:40,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:48:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:40,193 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:40,193 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:40,193 INFO L427 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-02-10 20:48:40,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:40,193 INFO L82 PathProgramCache]: Analyzing trace with hash 538933755, now seen corresponding path program 824 times [2020-02-10 20:48:40,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:40,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691959503] [2020-02-10 20:48:40,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:40,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691959503] [2020-02-10 20:48:40,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:40,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:40,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191854983] [2020-02-10 20:48:40,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:40,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:40,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:40,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:40,579 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:48:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:40,732 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-02-10 20:48:40,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:40,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:40,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:40,736 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:48:40,736 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 20:48:40,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-02-10 20:48:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 20:48:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 778. [2020-02-10 20:48:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 20:48:40,760 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 20:48:40,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:40,760 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 20:48:40,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 20:48:40,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:40,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:40,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-02-10 20:48:40,761 INFO L427 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-02-10 20:48:40,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:40,761 INFO L82 PathProgramCache]: Analyzing trace with hash 22084385, now seen corresponding path program 825 times [2020-02-10 20:48:40,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:40,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094369918] [2020-02-10 20:48:40,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:41,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094369918] [2020-02-10 20:48:41,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:41,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:41,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342979082] [2020-02-10 20:48:41,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:41,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:41,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:41,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:41,165 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:48:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:41,306 INFO L93 Difference]: Finished difference Result 1251 states and 4403 transitions. [2020-02-10 20:48:41,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:41,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:41,310 INFO L225 Difference]: With dead ends: 1251 [2020-02-10 20:48:41,310 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 20:48:41,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-02-10 20:48:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 20:48:41,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 783. [2020-02-10 20:48:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:48:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3111 transitions. [2020-02-10 20:48:41,333 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3111 transitions. Word has length 25 [2020-02-10 20:48:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:41,333 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3111 transitions. [2020-02-10 20:48:41,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3111 transitions. [2020-02-10 20:48:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:41,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:41,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-02-10 20:48:41,335 INFO L427 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-02-10 20:48:41,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash 559939963, now seen corresponding path program 826 times [2020-02-10 20:48:41,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:41,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809815853] [2020-02-10 20:48:41,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:41,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809815853] [2020-02-10 20:48:41,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:41,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:41,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979930659] [2020-02-10 20:48:41,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:41,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:41,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:41,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:41,715 INFO L87 Difference]: Start difference. First operand 783 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:48:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:41,853 INFO L93 Difference]: Finished difference Result 1250 states and 4396 transitions. [2020-02-10 20:48:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:41,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:41,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:41,857 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:48:41,857 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 20:48:41,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-02-10 20:48:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 20:48:41,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 778. [2020-02-10 20:48:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3099 transitions. [2020-02-10 20:48:41,880 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3099 transitions. Word has length 25 [2020-02-10 20:48:41,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:41,881 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3099 transitions. [2020-02-10 20:48:41,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3099 transitions. [2020-02-10 20:48:41,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:41,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:41,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:41,882 INFO L427 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-02-10 20:48:41,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:41,882 INFO L82 PathProgramCache]: Analyzing trace with hash 32587489, now seen corresponding path program 827 times [2020-02-10 20:48:41,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:41,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907147378] [2020-02-10 20:48:41,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:42,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907147378] [2020-02-10 20:48:42,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:42,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:42,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224617991] [2020-02-10 20:48:42,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:42,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:42,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:42,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:42,261 INFO L87 Difference]: Start difference. First operand 778 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:48:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:42,409 INFO L93 Difference]: Finished difference Result 1243 states and 4382 transitions. [2020-02-10 20:48:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:42,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:42,413 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:48:42,413 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 20:48:42,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 20:48:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 781. [2020-02-10 20:48:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 20:48:42,435 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 20:48:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:42,435 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 20:48:42,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 20:48:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:42,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:42,437 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:42,437 INFO L427 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-02-10 20:48:42,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:42,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1040497891, now seen corresponding path program 828 times [2020-02-10 20:48:42,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:42,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946001729] [2020-02-10 20:48:42,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:42,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946001729] [2020-02-10 20:48:42,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:42,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:42,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946158786] [2020-02-10 20:48:42,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:42,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:42,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:42,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:42,830 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:48:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:42,976 INFO L93 Difference]: Finished difference Result 1245 states and 4383 transitions. [2020-02-10 20:48:42,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:42,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:42,980 INFO L225 Difference]: With dead ends: 1245 [2020-02-10 20:48:42,980 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 20:48:42,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 20:48:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 775. [2020-02-10 20:48:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:48:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:48:43,003 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:48:43,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:43,003 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:48:43,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:48:43,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:43,004 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:43,004 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:43,004 INFO L427 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-02-10 20:48:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash -746410979, now seen corresponding path program 829 times [2020-02-10 20:48:43,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:43,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244734090] [2020-02-10 20:48:43,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:43,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244734090] [2020-02-10 20:48:43,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:43,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:43,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635052217] [2020-02-10 20:48:43,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:43,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:43,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:43,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:43,401 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:48:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:43,588 INFO L93 Difference]: Finished difference Result 1265 states and 4441 transitions. [2020-02-10 20:48:43,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:43,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:43,592 INFO L225 Difference]: With dead ends: 1265 [2020-02-10 20:48:43,592 INFO L226 Difference]: Without dead ends: 1250 [2020-02-10 20:48:43,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:43,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-02-10 20:48:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 786. [2020-02-10 20:48:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:48:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3121 transitions. [2020-02-10 20:48:43,615 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3121 transitions. Word has length 25 [2020-02-10 20:48:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:43,615 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3121 transitions. [2020-02-10 20:48:43,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3121 transitions. [2020-02-10 20:48:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:43,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:43,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:43,616 INFO L427 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-02-10 20:48:43,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:43,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1819496359, now seen corresponding path program 830 times [2020-02-10 20:48:43,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:43,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58307749] [2020-02-10 20:48:43,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48: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-02-10 20:48:44,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58307749] [2020-02-10 20:48:44,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:44,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:44,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27901826] [2020-02-10 20:48:44,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:44,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:44,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:44,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:44,021 INFO L87 Difference]: Start difference. First operand 786 states and 3121 transitions. Second operand 10 states. [2020-02-10 20:48:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:44,209 INFO L93 Difference]: Finished difference Result 1266 states and 4437 transitions. [2020-02-10 20:48:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:44,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:44,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:44,212 INFO L225 Difference]: With dead ends: 1266 [2020-02-10 20:48:44,213 INFO L226 Difference]: Without dead ends: 1244 [2020-02-10 20:48:44,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:44,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-02-10 20:48:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 780. [2020-02-10 20:48:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:48:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-02-10 20:48:44,236 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-02-10 20:48:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:44,236 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-02-10 20:48:44,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-02-10 20:48:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:44,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:44,237 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:44,238 INFO L427 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-02-10 20:48:44,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:44,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1948118463, now seen corresponding path program 831 times [2020-02-10 20:48:44,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:44,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105199302] [2020-02-10 20:48:44,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:44,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105199302] [2020-02-10 20:48:44,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:44,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:44,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225113572] [2020-02-10 20:48:44,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:44,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:44,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:44,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:44,632 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:48:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:44,776 INFO L93 Difference]: Finished difference Result 1262 states and 4429 transitions. [2020-02-10 20:48:44,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:44,777 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:44,780 INFO L225 Difference]: With dead ends: 1262 [2020-02-10 20:48:44,780 INFO L226 Difference]: Without dead ends: 1247 [2020-02-10 20:48:44,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2020-02-10 20:48:44,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 785. [2020-02-10 20:48:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:48:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3114 transitions. [2020-02-10 20:48:44,804 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3114 transitions. Word has length 25 [2020-02-10 20:48:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:44,804 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3114 transitions. [2020-02-10 20:48:44,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3114 transitions. [2020-02-10 20:48:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:44,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:44,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-02-10 20:48:44,805 INFO L427 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-02-10 20:48:44,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:44,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1808993255, now seen corresponding path program 832 times [2020-02-10 20:48:44,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:44,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826442323] [2020-02-10 20:48:44,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:45,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826442323] [2020-02-10 20:48:45,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:45,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:45,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559225802] [2020-02-10 20:48:45,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:45,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:45,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:45,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:45,195 INFO L87 Difference]: Start difference. First operand 785 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:48:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:45,383 INFO L93 Difference]: Finished difference Result 1261 states and 4422 transitions. [2020-02-10 20:48:45,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:45,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:45,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:45,387 INFO L225 Difference]: With dead ends: 1261 [2020-02-10 20:48:45,387 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 20:48:45,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-02-10 20:48:45,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 20:48:45,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-02-10 20:48:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:48:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-02-10 20:48:45,410 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-02-10 20:48:45,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:45,410 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-02-10 20:48:45,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:45,410 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-02-10 20:48:45,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:45,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:45,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-02-10 20:48:45,412 INFO L427 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-02-10 20:48:45,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:45,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1969124671, now seen corresponding path program 833 times [2020-02-10 20:48:45,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:45,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390516594] [2020-02-10 20:48:45,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:45,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390516594] [2020-02-10 20:48:45,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:45,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:45,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488216416] [2020-02-10 20:48:45,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:45,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:45,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:45,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:45,797 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:48:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:45,964 INFO L93 Difference]: Finished difference Result 1264 states and 4428 transitions. [2020-02-10 20:48:45,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:45,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:45,967 INFO L225 Difference]: With dead ends: 1264 [2020-02-10 20:48:45,967 INFO L226 Difference]: Without dead ends: 1248 [2020-02-10 20:48:45,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:45,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-02-10 20:48:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 785. [2020-02-10 20:48:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:48:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3109 transitions. [2020-02-10 20:48:45,990 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3109 transitions. Word has length 25 [2020-02-10 20:48:45,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:45,990 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3109 transitions. [2020-02-10 20:48:45,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3109 transitions. [2020-02-10 20:48:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:45,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:45,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-02-10 20:48:45,991 INFO L427 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-02-10 20:48:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:45,991 INFO L82 PathProgramCache]: Analyzing trace with hash -714901667, now seen corresponding path program 834 times [2020-02-10 20:48:45,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:45,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971781394] [2020-02-10 20:48:45,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:46,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971781394] [2020-02-10 20:48:46,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:46,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:46,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281877158] [2020-02-10 20:48:46,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:46,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:46,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:46,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:46,390 INFO L87 Difference]: Start difference. First operand 785 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:48:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:46,581 INFO L93 Difference]: Finished difference Result 1262 states and 4419 transitions. [2020-02-10 20:48:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:46,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:46,585 INFO L225 Difference]: With dead ends: 1262 [2020-02-10 20:48:46,585 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 20:48:46,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-02-10 20:48:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 20:48:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 775. [2020-02-10 20:48:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:48:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3088 transitions. [2020-02-10 20:48:46,608 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3088 transitions. Word has length 25 [2020-02-10 20:48:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:46,609 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3088 transitions. [2020-02-10 20:48:46,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:46,609 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3088 transitions. [2020-02-10 20:48:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:46,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:46,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-02-10 20:48:46,610 INFO L427 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-02-10 20:48:46,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:46,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1190126203, now seen corresponding path program 835 times [2020-02-10 20:48:46,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:46,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671498358] [2020-02-10 20:48:46,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48: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-02-10 20:48:46,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671498358] [2020-02-10 20:48:46,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:46,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:46,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194840983] [2020-02-10 20:48:46,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:46,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:46,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:46,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:46,981 INFO L87 Difference]: Start difference. First operand 775 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:48:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:47,168 INFO L93 Difference]: Finished difference Result 1246 states and 4388 transitions. [2020-02-10 20:48:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:47,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:47,172 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:48:47,172 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 20:48:47,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 20:48:47,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 781. [2020-02-10 20:48:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 20:48:47,195 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 20:48:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:47,195 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 20:48:47,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 20:48:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:47,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:47,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-02-10 20:48:47,196 INFO L427 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-02-10 20:48:47,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:47,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1493900135, now seen corresponding path program 836 times [2020-02-10 20:48:47,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:47,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986239802] [2020-02-10 20:48:47,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:47,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986239802] [2020-02-10 20:48:47,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:47,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:47,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254420882] [2020-02-10 20:48:47,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:47,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:47,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:47,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:47,572 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:48:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:47,758 INFO L93 Difference]: Finished difference Result 1250 states and 4393 transitions. [2020-02-10 20:48:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:47,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:47,761 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:48:47,761 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 20:48:47,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-02-10 20:48:47,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 20:48:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 778. [2020-02-10 20:48:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 20:48:47,784 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 20:48:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:47,785 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 20:48:47,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 20:48:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:47,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:47,786 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:47,786 INFO L427 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-02-10 20:48:47,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:47,786 INFO L82 PathProgramCache]: Analyzing trace with hash -410311651, now seen corresponding path program 837 times [2020-02-10 20:48:47,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:47,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074895705] [2020-02-10 20:48:47,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:48,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-02-10 20:48:48,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074895705] [2020-02-10 20:48:48,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:48,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:48,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557062237] [2020-02-10 20:48:48,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:48,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:48,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:48,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:48,176 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:48:48,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:48,369 INFO L93 Difference]: Finished difference Result 1244 states and 4381 transitions. [2020-02-10 20:48:48,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:48,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:48,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:48,373 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:48:48,373 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:48:48,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:48:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-02-10 20:48:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3101 transitions. [2020-02-10 20:48:48,396 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3101 transitions. Word has length 25 [2020-02-10 20:48:48,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:48,397 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3101 transitions. [2020-02-10 20:48:48,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3101 transitions. [2020-02-10 20:48:48,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:48,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:48,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-02-10 20:48:48,398 INFO L427 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-02-10 20:48:48,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:48,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1483397031, now seen corresponding path program 838 times [2020-02-10 20:48:48,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:48,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338723811] [2020-02-10 20:48:48,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:48,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338723811] [2020-02-10 20:48:48,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:48,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:48,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671063100] [2020-02-10 20:48:48,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:48,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:48,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:48,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:48,779 INFO L87 Difference]: Start difference. First operand 781 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:48:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:48,972 INFO L93 Difference]: Finished difference Result 1246 states and 4382 transitions. [2020-02-10 20:48:48,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:48,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:48,976 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:48:48,976 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 20:48:48,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:48,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 20:48:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 778. [2020-02-10 20:48:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3093 transitions. [2020-02-10 20:48:49,000 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3093 transitions. Word has length 25 [2020-02-10 20:48:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:49,000 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3093 transitions. [2020-02-10 20:48:49,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3093 transitions. [2020-02-10 20:48:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:49,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:49,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-02-10 20:48:49,002 INFO L427 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-02-10 20:48:49,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:49,002 INFO L82 PathProgramCache]: Analyzing trace with hash -399808547, now seen corresponding path program 839 times [2020-02-10 20:48:49,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:49,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740393760] [2020-02-10 20:48:49,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:49,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740393760] [2020-02-10 20:48:49,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:49,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:49,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920532477] [2020-02-10 20:48:49,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:49,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:49,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:49,383 INFO L87 Difference]: Start difference. First operand 778 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:48:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:49,573 INFO L93 Difference]: Finished difference Result 1254 states and 4400 transitions. [2020-02-10 20:48:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:49,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:49,577 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 20:48:49,577 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 20:48:49,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-02-10 20:48:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 20:48:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 783. [2020-02-10 20:48:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:48:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3102 transitions. [2020-02-10 20:48:49,600 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3102 transitions. Word has length 25 [2020-02-10 20:48:49,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:49,600 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3102 transitions. [2020-02-10 20:48:49,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3102 transitions. [2020-02-10 20:48:49,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:49,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:49,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-02-10 20:48:49,601 INFO L427 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-02-10 20:48:49,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:49,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1211132411, now seen corresponding path program 840 times [2020-02-10 20:48:49,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:49,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846084781] [2020-02-10 20:48:49,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:49,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846084781] [2020-02-10 20:48:49,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:49,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:49,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227315652] [2020-02-10 20:48:49,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:49,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:49,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:49,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:49,991 INFO L87 Difference]: Start difference. First operand 783 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:48:50,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:50,189 INFO L93 Difference]: Finished difference Result 1252 states and 4391 transitions. [2020-02-10 20:48:50,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:50,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:50,192 INFO L225 Difference]: With dead ends: 1252 [2020-02-10 20:48:50,192 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:48:50,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-02-10 20:48:50,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:48:50,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 769. [2020-02-10 20:48:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 20:48:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3076 transitions. [2020-02-10 20:48:50,215 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3076 transitions. Word has length 25 [2020-02-10 20:48:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:50,215 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3076 transitions. [2020-02-10 20:48:50,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3076 transitions. [2020-02-10 20:48:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:50,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:50,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-02-10 20:48:50,217 INFO L427 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-02-10 20:48:50,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:50,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1423698301, now seen corresponding path program 841 times [2020-02-10 20:48:50,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:50,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192725464] [2020-02-10 20:48:50,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:50,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192725464] [2020-02-10 20:48:50,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:50,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:50,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263042602] [2020-02-10 20:48:50,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:50,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:50,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:50,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:50,573 INFO L87 Difference]: Start difference. First operand 769 states and 3076 transitions. Second operand 10 states. [2020-02-10 20:48:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:50,768 INFO L93 Difference]: Finished difference Result 1213 states and 4289 transitions. [2020-02-10 20:48:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:50,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:50,772 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:48:50,772 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:48:50,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-02-10 20:48:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:48:50,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 781. [2020-02-10 20:48:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-02-10 20:48:50,795 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-02-10 20:48:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:50,795 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-02-10 20:48:50,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-02-10 20:48:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:50,796 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:50,796 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:50,796 INFO L427 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-02-10 20:48:50,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:50,796 INFO L82 PathProgramCache]: Analyzing trace with hash -453446687, now seen corresponding path program 842 times [2020-02-10 20:48:50,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:50,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190489117] [2020-02-10 20:48:50,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:51,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190489117] [2020-02-10 20:48:51,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:51,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:51,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032256810] [2020-02-10 20:48:51,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:51,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:51,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:51,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:51,165 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:48:51,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:51,322 INFO L93 Difference]: Finished difference Result 1215 states and 4289 transitions. [2020-02-10 20:48:51,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:51,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:51,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:51,326 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:48:51,326 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:48:51,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-02-10 20:48:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:48:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-02-10 20:48:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:48:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3109 transitions. [2020-02-10 20:48:51,348 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3109 transitions. Word has length 25 [2020-02-10 20:48:51,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:51,349 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3109 transitions. [2020-02-10 20:48:51,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3109 transitions. [2020-02-10 20:48:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:51,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:51,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-02-10 20:48:51,350 INFO L427 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-02-10 20:48:51,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash 502335777, now seen corresponding path program 843 times [2020-02-10 20:48:51,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:51,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483394918] [2020-02-10 20:48:51,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:51,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483394918] [2020-02-10 20:48:51,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:51,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:51,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949865856] [2020-02-10 20:48:51,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:51,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:51,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:51,729 INFO L87 Difference]: Start difference. First operand 777 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:48:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:51,922 INFO L93 Difference]: Finished difference Result 1209 states and 4277 transitions. [2020-02-10 20:48:51,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:51,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:51,926 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:48:51,926 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:48:51,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-02-10 20:48:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:48:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 780. [2020-02-10 20:48:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:48:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3114 transitions. [2020-02-10 20:48:51,948 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3114 transitions. Word has length 25 [2020-02-10 20:48:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:51,948 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3114 transitions. [2020-02-10 20:48:51,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3114 transitions. [2020-02-10 20:48:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:51,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:51,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-02-10 20:48:51,950 INFO L427 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-02-10 20:48:51,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:51,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1483090495, now seen corresponding path program 844 times [2020-02-10 20:48:51,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:51,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138934227] [2020-02-10 20:48:51,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:52,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138934227] [2020-02-10 20:48:52,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:52,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:52,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83301458] [2020-02-10 20:48:52,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:52,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:52,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:52,321 INFO L87 Difference]: Start difference. First operand 780 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:48:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:52,519 INFO L93 Difference]: Finished difference Result 1208 states and 4272 transitions. [2020-02-10 20:48:52,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:52,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:52,523 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:48:52,523 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:48:52,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:48:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 20:48:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:48:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3106 transitions. [2020-02-10 20:48:52,546 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3106 transitions. Word has length 25 [2020-02-10 20:48:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:52,546 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3106 transitions. [2020-02-10 20:48:52,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:52,546 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3106 transitions. [2020-02-10 20:48:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:52,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:52,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-02-10 20:48:52,547 INFO L427 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-02-10 20:48:52,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:52,547 INFO L82 PathProgramCache]: Analyzing trace with hash -114821501, now seen corresponding path program 845 times [2020-02-10 20:48:52,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:52,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328344908] [2020-02-10 20:48:52,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:52,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328344908] [2020-02-10 20:48:52,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:52,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:52,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407284703] [2020-02-10 20:48:52,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:52,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:52,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:52,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:52,913 INFO L87 Difference]: Start difference. First operand 777 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:48:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:53,064 INFO L93 Difference]: Finished difference Result 1213 states and 4282 transitions. [2020-02-10 20:48:53,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:53,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:53,068 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:48:53,068 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:48:53,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-02-10 20:48:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:48:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 780. [2020-02-10 20:48:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:48:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 20:48:53,091 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 20:48:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:53,091 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 20:48:53,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 20:48:53,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:53,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:53,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-02-10 20:48:53,092 INFO L427 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-02-10 20:48:53,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:53,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1496119457, now seen corresponding path program 846 times [2020-02-10 20:48:53,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:53,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177853587] [2020-02-10 20:48:53,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:53,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177853587] [2020-02-10 20:48:53,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:53,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:53,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236732419] [2020-02-10 20:48:53,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:53,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:53,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:53,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:53,462 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:48:53,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:53,623 INFO L93 Difference]: Finished difference Result 1210 states and 4273 transitions. [2020-02-10 20:48:53,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:53,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:53,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:53,626 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:48:53,626 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:48:53,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-02-10 20:48:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:48:53,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 774. [2020-02-10 20:48:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:48:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3098 transitions. [2020-02-10 20:48:53,648 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3098 transitions. Word has length 25 [2020-02-10 20:48:53,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:53,649 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3098 transitions. [2020-02-10 20:48:53,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3098 transitions. [2020-02-10 20:48:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:53,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:53,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-02-10 20:48:53,650 INFO L427 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-02-10 20:48:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1846184027, now seen corresponding path program 847 times [2020-02-10 20:48:53,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:53,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146848058] [2020-02-10 20:48:53,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:54,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146848058] [2020-02-10 20:48:54,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:54,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:54,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716856277] [2020-02-10 20:48:54,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:54,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:54,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:54,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:54,023 INFO L87 Difference]: Start difference. First operand 774 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:48:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:54,173 INFO L93 Difference]: Finished difference Result 1222 states and 4310 transitions. [2020-02-10 20:48:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:54,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:54,177 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 20:48:54,177 INFO L226 Difference]: Without dead ends: 1209 [2020-02-10 20:48:54,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-02-10 20:48:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-02-10 20:48:54,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 782. [2020-02-10 20:48:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:48:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3120 transitions. [2020-02-10 20:48:54,201 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3120 transitions. Word has length 25 [2020-02-10 20:48:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:54,201 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3120 transitions. [2020-02-10 20:48:54,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3120 transitions. [2020-02-10 20:48:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:54,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:54,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-02-10 20:48:54,203 INFO L427 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-02-10 20:48:54,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash -875932413, now seen corresponding path program 848 times [2020-02-10 20:48:54,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:54,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355457772] [2020-02-10 20:48:54,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:54,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355457772] [2020-02-10 20:48:54,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:54,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:54,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686983418] [2020-02-10 20:48:54,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:54,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:54,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:54,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:54,570 INFO L87 Difference]: Start difference. First operand 782 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:48:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:54,717 INFO L93 Difference]: Finished difference Result 1224 states and 4310 transitions. [2020-02-10 20:48:54,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:54,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:54,720 INFO L225 Difference]: With dead ends: 1224 [2020-02-10 20:48:54,720 INFO L226 Difference]: Without dead ends: 1205 [2020-02-10 20:48:54,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-02-10 20:48:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 778. [2020-02-10 20:48:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3109 transitions. [2020-02-10 20:48:54,743 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3109 transitions. Word has length 25 [2020-02-10 20:48:54,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:54,743 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3109 transitions. [2020-02-10 20:48:54,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3109 transitions. [2020-02-10 20:48:54,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:54,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:54,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-02-10 20:48:54,745 INFO L427 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-02-10 20:48:54,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:54,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2005884129, now seen corresponding path program 849 times [2020-02-10 20:48:54,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:54,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967016994] [2020-02-10 20:48:54,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:55,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967016994] [2020-02-10 20:48:55,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:55,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:55,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156121050] [2020-02-10 20:48:55,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:55,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:55,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:55,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:55,118 INFO L87 Difference]: Start difference. First operand 778 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:48:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:55,313 INFO L93 Difference]: Finished difference Result 1223 states and 4308 transitions. [2020-02-10 20:48:55,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:55,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:55,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:55,316 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 20:48:55,316 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 20:48:55,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-02-10 20:48:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 20:48:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 782. [2020-02-10 20:48:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:48:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3116 transitions. [2020-02-10 20:48:55,340 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3116 transitions. Word has length 25 [2020-02-10 20:48:55,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:55,340 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3116 transitions. [2020-02-10 20:48:55,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3116 transitions. [2020-02-10 20:48:55,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:55,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:55,341 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:55,341 INFO L427 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-02-10 20:48:55,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:55,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1297825345, now seen corresponding path program 850 times [2020-02-10 20:48:55,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:55,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980391890] [2020-02-10 20:48:55,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:55,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980391890] [2020-02-10 20:48:55,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:55,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:55,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101413162] [2020-02-10 20:48:55,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:55,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:55,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:55,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:55,735 INFO L87 Difference]: Start difference. First operand 782 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:48:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:55,934 INFO L93 Difference]: Finished difference Result 1226 states and 4310 transitions. [2020-02-10 20:48:55,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:55,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:55,937 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:48:55,938 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 20:48:55,938 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 20:48:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 778. [2020-02-10 20:48:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:48:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 20:48:55,960 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 20:48:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:55,961 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 20:48:55,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 20:48:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:55,962 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:55,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-02-10 20:48:55,962 INFO L427 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-02-10 20:48:55,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:55,962 INFO L82 PathProgramCache]: Analyzing trace with hash -211711003, now seen corresponding path program 851 times [2020-02-10 20:48:55,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:55,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463774861] [2020-02-10 20:48:55,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:56,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463774861] [2020-02-10 20:48:56,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:56,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:56,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612436545] [2020-02-10 20:48:56,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:56,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:56,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:56,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:56,339 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:48:56,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:56,485 INFO L93 Difference]: Finished difference Result 1229 states and 4318 transitions. [2020-02-10 20:48:56,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:56,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:56,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:56,489 INFO L225 Difference]: With dead ends: 1229 [2020-02-10 20:48:56,489 INFO L226 Difference]: Without dead ends: 1214 [2020-02-10 20:48:56,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-02-10 20:48:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 784. [2020-02-10 20:48:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:48:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3116 transitions. [2020-02-10 20:48:56,512 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3116 transitions. Word has length 25 [2020-02-10 20:48:56,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:56,512 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3116 transitions. [2020-02-10 20:48:56,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3116 transitions. [2020-02-10 20:48:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:56,513 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:56,513 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:56,514 INFO L427 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-02-10 20:48:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:56,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1284796383, now seen corresponding path program 852 times [2020-02-10 20:48:56,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:56,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930638085] [2020-02-10 20:48:56,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:56,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930638085] [2020-02-10 20:48:56,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:56,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:56,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831117980] [2020-02-10 20:48:56,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:56,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:56,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:56,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:56,888 INFO L87 Difference]: Start difference. First operand 784 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:48:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:57,023 INFO L93 Difference]: Finished difference Result 1230 states and 4314 transitions. [2020-02-10 20:48:57,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:57,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:57,026 INFO L225 Difference]: With dead ends: 1230 [2020-02-10 20:48:57,027 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:48:57,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-02-10 20:48:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:48:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 774. [2020-02-10 20:48:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:48:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3095 transitions. [2020-02-10 20:48:57,049 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3095 transitions. Word has length 25 [2020-02-10 20:48:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:57,050 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3095 transitions. [2020-02-10 20:48:57,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3095 transitions. [2020-02-10 20:48:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:57,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:57,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:57,051 INFO L427 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-02-10 20:48:57,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:57,051 INFO L82 PathProgramCache]: Analyzing trace with hash -342635675, now seen corresponding path program 853 times [2020-02-10 20:48:57,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:57,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93127898] [2020-02-10 20:48:57,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:57,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93127898] [2020-02-10 20:48:57,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:57,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:57,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488138276] [2020-02-10 20:48:57,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:57,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:57,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:57,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:57,462 INFO L87 Difference]: Start difference. First operand 774 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:48:57,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:57,599 INFO L93 Difference]: Finished difference Result 1210 states and 4276 transitions. [2020-02-10 20:48:57,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:57,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:57,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:57,602 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:48:57,602 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 20:48:57,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-02-10 20:48:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 20:48:57,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 780. [2020-02-10 20:48:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:48:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 20:48:57,625 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 20:48:57,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:57,625 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 20:48:57,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 20:48:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:57,626 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:57,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-02-10 20:48:57,626 INFO L427 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-02-10 20:48:57,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:57,626 INFO L82 PathProgramCache]: Analyzing trace with hash 638119043, now seen corresponding path program 854 times [2020-02-10 20:48:57,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:57,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020734286] [2020-02-10 20:48:57,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:57,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020734286] [2020-02-10 20:48:57,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:57,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:57,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915867911] [2020-02-10 20:48:57,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:57,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:57,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:57,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:57,999 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:48:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:58,157 INFO L93 Difference]: Finished difference Result 1209 states and 4271 transitions. [2020-02-10 20:48:58,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:58,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:58,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:58,161 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:48:58,161 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:48:58,161 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:58,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:48:58,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-02-10 20:48:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:48:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3103 transitions. [2020-02-10 20:48:58,185 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3103 transitions. Word has length 25 [2020-02-10 20:48:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:58,185 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3103 transitions. [2020-02-10 20:48:58,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3103 transitions. [2020-02-10 20:48:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:58,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:58,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:58,186 INFO L427 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-02-10 20:48:58,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:58,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1583398403, now seen corresponding path program 855 times [2020-02-10 20:48:58,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:58,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367551035] [2020-02-10 20:48:58,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:58,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367551035] [2020-02-10 20:48:58,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:58,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:58,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50741196] [2020-02-10 20:48:58,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:58,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:58,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:58,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:58,561 INFO L87 Difference]: Start difference. First operand 777 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:48:58,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:58,693 INFO L93 Difference]: Finished difference Result 1215 states and 4284 transitions. [2020-02-10 20:48:58,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:58,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:58,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:58,697 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:48:58,697 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:48:58,697 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:48:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:48:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 781. [2020-02-10 20:48:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:48:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:48:58,720 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:48:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:58,721 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:48:58,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:48:58,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:58,722 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:58,722 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:48:58,722 INFO L427 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-02-10 20:48:58,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:58,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1720311071, now seen corresponding path program 856 times [2020-02-10 20:48:58,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:58,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129942244] [2020-02-10 20:48:58,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:59,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129942244] [2020-02-10 20:48:59,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:59,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:59,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627376000] [2020-02-10 20:48:59,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:59,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:59,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:59,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:59,096 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:48:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:59,236 INFO L93 Difference]: Finished difference Result 1218 states and 4286 transitions. [2020-02-10 20:48:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:59,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:59,240 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 20:48:59,240 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:48:59,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-02-10 20:48:59,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:48:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-02-10 20:48:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:48:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 20:48:59,433 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 20:48:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:59,433 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 20:48:59,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:59,433 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 20:48:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:59,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:59,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-02-10 20:48:59,434 INFO L427 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-02-10 20:48:59,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:59,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1302340453, now seen corresponding path program 857 times [2020-02-10 20:48:59,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:59,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374204789] [2020-02-10 20:48:59,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:48:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:48:59,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374204789] [2020-02-10 20:48:59,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:48:59,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:48:59,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125174682] [2020-02-10 20:48:59,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:48:59,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:48:59,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:48:59,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:48:59,813 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:48:59,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:48:59,947 INFO L93 Difference]: Finished difference Result 1212 states and 4274 transitions. [2020-02-10 20:48:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:48:59,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:48:59,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:48:59,950 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:48:59,951 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:48:59,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-02-10 20:48:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:48:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 780. [2020-02-10 20:48:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:48:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-02-10 20:48:59,974 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-02-10 20:48:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:48:59,974 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-02-10 20:48:59,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:48:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-02-10 20:48:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:48:59,975 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:48:59,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-02-10 20:48:59,975 INFO L427 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-02-10 20:48:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:48:59,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1381685885, now seen corresponding path program 858 times [2020-02-10 20:48:59,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:48:59,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721849231] [2020-02-10 20:48:59,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:48:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:00,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721849231] [2020-02-10 20:49:00,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:00,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:00,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463765345] [2020-02-10 20:49:00,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:00,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:00,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:00,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:00,340 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:49:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:00,480 INFO L93 Difference]: Finished difference Result 1216 states and 4279 transitions. [2020-02-10 20:49:00,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:00,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:00,484 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:49:00,484 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:49:00,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:49:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 774. [2020-02-10 20:49:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:49:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3092 transitions. [2020-02-10 20:49:00,507 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3092 transitions. Word has length 25 [2020-02-10 20:49:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:00,507 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3092 transitions. [2020-02-10 20:49:00,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3092 transitions. [2020-02-10 20:49:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:00,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:00,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:00,508 INFO L427 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-02-10 20:49:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash -998794271, now seen corresponding path program 859 times [2020-02-10 20:49:00,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:00,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114458893] [2020-02-10 20:49:00,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:00,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114458893] [2020-02-10 20:49:00,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:00,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:00,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153553053] [2020-02-10 20:49:00,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:00,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:00,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:00,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:00,888 INFO L87 Difference]: Start difference. First operand 774 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:49:01,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:01,023 INFO L93 Difference]: Finished difference Result 1218 states and 4291 transitions. [2020-02-10 20:49:01,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:01,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:01,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:01,027 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 20:49:01,027 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 20:49:01,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-02-10 20:49:01,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 20:49:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 780. [2020-02-10 20:49:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:49:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3108 transitions. [2020-02-10 20:49:01,050 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3108 transitions. Word has length 25 [2020-02-10 20:49:01,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:01,050 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3108 transitions. [2020-02-10 20:49:01,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3108 transitions. [2020-02-10 20:49:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:01,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:01,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:01,051 INFO L427 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-02-10 20:49:01,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:01,052 INFO L82 PathProgramCache]: Analyzing trace with hash 612146687, now seen corresponding path program 860 times [2020-02-10 20:49:01,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:01,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199527188] [2020-02-10 20:49:01,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:01,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199527188] [2020-02-10 20:49:01,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:01,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:01,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593728521] [2020-02-10 20:49:01,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:01,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:01,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:01,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:01,443 INFO L87 Difference]: Start difference. First operand 780 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:49:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:01,575 INFO L93 Difference]: Finished difference Result 1215 states and 4282 transitions. [2020-02-10 20:49:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:01,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:01,579 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:49:01,579 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:49:01,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:49:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 777. [2020-02-10 20:49:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 20:49:01,602 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 20:49:01,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:01,602 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 20:49:01,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 20:49:01,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:01,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:01,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-02-10 20:49:01,604 INFO L427 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-02-10 20:49:01,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:01,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1695735171, now seen corresponding path program 861 times [2020-02-10 20:49:01,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:01,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345157903] [2020-02-10 20:49:01,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:01,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345157903] [2020-02-10 20:49:01,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:01,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:01,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235177284] [2020-02-10 20:49:01,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:01,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:01,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:01,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:01,980 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:49:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:02,109 INFO L93 Difference]: Finished difference Result 1225 states and 4305 transitions. [2020-02-10 20:49:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:02,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:02,112 INFO L225 Difference]: With dead ends: 1225 [2020-02-10 20:49:02,113 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 20:49:02,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-02-10 20:49:02,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 20:49:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 783. [2020-02-10 20:49:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:49:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3111 transitions. [2020-02-10 20:49:02,136 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3111 transitions. Word has length 25 [2020-02-10 20:49:02,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:02,136 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3111 transitions. [2020-02-10 20:49:02,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3111 transitions. [2020-02-10 20:49:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:02,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:02,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-02-10 20:49:02,137 INFO L427 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-02-10 20:49:02,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash 622649791, now seen corresponding path program 862 times [2020-02-10 20:49:02,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:02,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217231627] [2020-02-10 20:49:02,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:02,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217231627] [2020-02-10 20:49:02,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:02,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:02,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962828324] [2020-02-10 20:49:02,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:02,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:02,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:02,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:02,517 INFO L87 Difference]: Start difference. First operand 783 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:49:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:02,654 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-02-10 20:49:02,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:02,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:02,658 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:49:02,658 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:49:02,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:49:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 777. [2020-02-10 20:49:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 20:49:02,682 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 20:49:02,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:02,682 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 20:49:02,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 20:49:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:02,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:02,683 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:02,683 INFO L427 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-02-10 20:49:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:02,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1706238275, now seen corresponding path program 863 times [2020-02-10 20:49:02,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:02,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333367907] [2020-02-10 20:49:02,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:03,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333367907] [2020-02-10 20:49:03,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:03,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:03,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841250681] [2020-02-10 20:49:03,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:03,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:03,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:03,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:03,051 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:49:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:03,188 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 20:49:03,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:03,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:03,191 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:49:03,191 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:49:03,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:49:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 780. [2020-02-10 20:49:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:49:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3102 transitions. [2020-02-10 20:49:03,214 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3102 transitions. Word has length 25 [2020-02-10 20:49:03,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:03,214 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3102 transitions. [2020-02-10 20:49:03,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3102 transitions. [2020-02-10 20:49:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:03,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:03,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-02-10 20:49:03,215 INFO L427 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-02-10 20:49:03,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:03,216 INFO L82 PathProgramCache]: Analyzing trace with hash -977788063, now seen corresponding path program 864 times [2020-02-10 20:49:03,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:03,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562693623] [2020-02-10 20:49:03,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49: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-02-10 20:49:03,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562693623] [2020-02-10 20:49:03,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:03,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:03,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023619912] [2020-02-10 20:49:03,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:03,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:03,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:03,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:03,601 INFO L87 Difference]: Start difference. First operand 780 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:49:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:03,734 INFO L93 Difference]: Finished difference Result 1220 states and 4286 transitions. [2020-02-10 20:49:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:03,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:03,738 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:49:03,738 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 20:49:03,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-02-10 20:49:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 20:49:03,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 771. [2020-02-10 20:49:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:49:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3085 transitions. [2020-02-10 20:49:03,761 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3085 transitions. Word has length 25 [2020-02-10 20:49:03,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:03,761 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3085 transitions. [2020-02-10 20:49:03,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3085 transitions. [2020-02-10 20:49:03,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:03,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:03,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-02-10 20:49:03,763 INFO L427 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-02-10 20:49:03,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:03,763 INFO L82 PathProgramCache]: Analyzing trace with hash -2060165155, now seen corresponding path program 865 times [2020-02-10 20:49:03,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:03,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583233689] [2020-02-10 20:49:03,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:04,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583233689] [2020-02-10 20:49:04,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:04,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:04,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949062904] [2020-02-10 20:49:04,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:04,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:04,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:04,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:04,135 INFO L87 Difference]: Start difference. First operand 771 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:49:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:04,274 INFO L93 Difference]: Finished difference Result 1196 states and 4235 transitions. [2020-02-10 20:49:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:04,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:04,278 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:49:04,278 INFO L226 Difference]: Without dead ends: 1183 [2020-02-10 20:49:04,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-02-10 20:49:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-02-10 20:49:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 780. [2020-02-10 20:49:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:49:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-02-10 20:49:04,301 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-02-10 20:49:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:04,302 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-02-10 20:49:04,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-02-10 20:49:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:04,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:04,303 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:04,303 INFO L427 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-02-10 20:49:04,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:04,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1089913541, now seen corresponding path program 866 times [2020-02-10 20:49:04,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:04,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408733108] [2020-02-10 20:49:04,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:04,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408733108] [2020-02-10 20:49:04,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:04,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:04,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510778790] [2020-02-10 20:49:04,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:04,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:04,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:04,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:04,664 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:49:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:04,799 INFO L93 Difference]: Finished difference Result 1198 states and 4235 transitions. [2020-02-10 20:49:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:04,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:04,803 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 20:49:04,803 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:49:04,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-02-10 20:49:04,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:49:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 776. [2020-02-10 20:49:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:49:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3102 transitions. [2020-02-10 20:49:04,826 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3102 transitions. Word has length 25 [2020-02-10 20:49:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:04,826 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3102 transitions. [2020-02-10 20:49:04,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3102 transitions. [2020-02-10 20:49:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:04,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:04,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-02-10 20:49:04,827 INFO L427 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-02-10 20:49:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:04,828 INFO L82 PathProgramCache]: Analyzing trace with hash -134131077, now seen corresponding path program 867 times [2020-02-10 20:49:04,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:04,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441119756] [2020-02-10 20:49:04,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:05,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441119756] [2020-02-10 20:49:05,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:05,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:05,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075313154] [2020-02-10 20:49:05,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:05,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:05,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:05,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:05,204 INFO L87 Difference]: Start difference. First operand 776 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:49:05,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:05,337 INFO L93 Difference]: Finished difference Result 1192 states and 4223 transitions. [2020-02-10 20:49:05,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:05,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:05,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:05,341 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:49:05,341 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:49:05,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:49:05,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 779. [2020-02-10 20:49:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:49:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3107 transitions. [2020-02-10 20:49:05,364 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3107 transitions. Word has length 25 [2020-02-10 20:49:05,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:05,365 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3107 transitions. [2020-02-10 20:49:05,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3107 transitions. [2020-02-10 20:49:05,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:05,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:05,366 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:05,366 INFO L427 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-02-10 20:49:05,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:05,366 INFO L82 PathProgramCache]: Analyzing trace with hash 846623641, now seen corresponding path program 868 times [2020-02-10 20:49:05,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:05,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541124994] [2020-02-10 20:49:05,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:05,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541124994] [2020-02-10 20:49:05,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:05,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:05,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297983919] [2020-02-10 20:49:05,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:05,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:05,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:05,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:05,757 INFO L87 Difference]: Start difference. First operand 779 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:49:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:05,921 INFO L93 Difference]: Finished difference Result 1191 states and 4218 transitions. [2020-02-10 20:49:05,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:05,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:05,925 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:49:05,925 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:49:05,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-02-10 20:49:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:49:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 776. [2020-02-10 20:49:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:49:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3099 transitions. [2020-02-10 20:49:05,948 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3099 transitions. Word has length 25 [2020-02-10 20:49:05,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:05,948 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3099 transitions. [2020-02-10 20:49:05,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3099 transitions. [2020-02-10 20:49:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:05,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:05,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-02-10 20:49:05,950 INFO L427 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-02-10 20:49:05,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:05,950 INFO L82 PathProgramCache]: Analyzing trace with hash -751288355, now seen corresponding path program 869 times [2020-02-10 20:49:05,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:05,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20011280] [2020-02-10 20:49:05,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:06,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20011280] [2020-02-10 20:49:06,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:06,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:06,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562594451] [2020-02-10 20:49:06,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:06,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:06,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:06,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:06,314 INFO L87 Difference]: Start difference. First operand 776 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:49:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:06,453 INFO L93 Difference]: Finished difference Result 1196 states and 4228 transitions. [2020-02-10 20:49:06,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:06,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:06,457 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:49:06,457 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:49:06,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:49:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-02-10 20:49:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:49:06,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 20:49:06,481 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 20:49:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:06,481 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 20:49:06,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 20:49:06,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:06,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:06,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:06,482 INFO L427 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-02-10 20:49:06,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:06,482 INFO L82 PathProgramCache]: Analyzing trace with hash 859652603, now seen corresponding path program 870 times [2020-02-10 20:49:06,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:06,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990653] [2020-02-10 20:49:06,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:06,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990653] [2020-02-10 20:49:06,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:06,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:06,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282554453] [2020-02-10 20:49:06,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:06,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:06,859 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:49:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:07,012 INFO L93 Difference]: Finished difference Result 1193 states and 4219 transitions. [2020-02-10 20:49:07,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:07,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:07,016 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:49:07,016 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:49:07,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-02-10 20:49:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:49:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 773. [2020-02-10 20:49:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:49:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3092 transitions. [2020-02-10 20:49:07,039 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3092 transitions. Word has length 25 [2020-02-10 20:49:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:07,039 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3092 transitions. [2020-02-10 20:49:07,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3092 transitions. [2020-02-10 20:49:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:07,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:07,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-02-10 20:49:07,040 INFO L427 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-02-10 20:49:07,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:07,040 INFO L82 PathProgramCache]: Analyzing trace with hash 544859237, now seen corresponding path program 871 times [2020-02-10 20:49:07,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:07,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905273676] [2020-02-10 20:49:07,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:07,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905273676] [2020-02-10 20:49:07,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:07,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:07,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818153974] [2020-02-10 20:49:07,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:07,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:07,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:07,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:07,399 INFO L87 Difference]: Start difference. First operand 773 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:49:07,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:07,552 INFO L93 Difference]: Finished difference Result 1192 states and 4221 transitions. [2020-02-10 20:49:07,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:07,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:07,556 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:49:07,556 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:49:07,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:49:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 779. [2020-02-10 20:49:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:49:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3106 transitions. [2020-02-10 20:49:07,578 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3106 transitions. Word has length 25 [2020-02-10 20:49:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:07,578 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3106 transitions. [2020-02-10 20:49:07,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3106 transitions. [2020-02-10 20:49:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:07,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:07,579 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:07,579 INFO L427 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-02-10 20:49:07,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:07,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1515110851, now seen corresponding path program 872 times [2020-02-10 20:49:07,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:07,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106777820] [2020-02-10 20:49:07,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:07,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106777820] [2020-02-10 20:49:07,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:07,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:07,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240501767] [2020-02-10 20:49:07,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:07,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:07,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:07,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:07,949 INFO L87 Difference]: Start difference. First operand 779 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:49:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:08,084 INFO L93 Difference]: Finished difference Result 1194 states and 4221 transitions. [2020-02-10 20:49:08,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:08,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:08,088 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:49:08,088 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:49:08,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:49:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-02-10 20:49:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-02-10 20:49:08,110 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-02-10 20:49:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:08,111 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-02-10 20:49:08,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-02-10 20:49:08,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:08,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:08,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-02-10 20:49:08,112 INFO L427 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-02-10 20:49:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:08,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1585095035, now seen corresponding path program 873 times [2020-02-10 20:49:08,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:08,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62910475] [2020-02-10 20:49:08,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:08,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62910475] [2020-02-10 20:49:08,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:08,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:08,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958467153] [2020-02-10 20:49:08,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:08,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:08,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:08,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:08,486 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:49:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:08,621 INFO L93 Difference]: Finished difference Result 1186 states and 4205 transitions. [2020-02-10 20:49:08,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:08,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:08,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:08,625 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:49:08,625 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:49:08,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:08,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:49:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 777. [2020-02-10 20:49:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 20:49:08,647 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 20:49:08,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:08,647 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 20:49:08,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 20:49:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:08,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:08,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-02-10 20:49:08,649 INFO L427 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-02-10 20:49:08,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:08,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1687105127, now seen corresponding path program 874 times [2020-02-10 20:49:08,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:08,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859577340] [2020-02-10 20:49:08,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:09,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859577340] [2020-02-10 20:49:09,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:09,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:09,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809998470] [2020-02-10 20:49:09,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:09,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:09,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:09,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:09,016 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:49:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:09,157 INFO L93 Difference]: Finished difference Result 1184 states and 4199 transitions. [2020-02-10 20:49:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:09,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:09,160 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:49:09,161 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:49:09,161 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:09,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:49:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 20:49:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-02-10 20:49:09,183 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-02-10 20:49:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:09,183 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-02-10 20:49:09,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-02-10 20:49:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:09,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:09,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-02-10 20:49:09,184 INFO L427 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-02-10 20:49:09,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:09,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1138846363, now seen corresponding path program 875 times [2020-02-10 20:49:09,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:09,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695490357] [2020-02-10 20:49:09,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:09,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695490357] [2020-02-10 20:49:09,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:09,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:09,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128444339] [2020-02-10 20:49:09,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:09,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:09,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:09,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:09,541 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:49:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:09,677 INFO L93 Difference]: Finished difference Result 1190 states and 4211 transitions. [2020-02-10 20:49:09,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:09,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:09,680 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:49:09,680 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:49:09,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:49:09,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 20:49:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 20:49:09,703 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 20:49:09,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:09,703 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 20:49:09,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:09,703 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 20:49:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:09,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:09,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-02-10 20:49:09,704 INFO L427 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-02-10 20:49:09,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:09,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1674076165, now seen corresponding path program 876 times [2020-02-10 20:49:09,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:09,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622501651] [2020-02-10 20:49:09,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:10,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622501651] [2020-02-10 20:49:10,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:10,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:10,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082408259] [2020-02-10 20:49:10,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:10,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:10,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:10,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:10,073 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:49:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:10,213 INFO L93 Difference]: Finished difference Result 1186 states and 4201 transitions. [2020-02-10 20:49:10,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:10,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:10,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:10,216 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:49:10,217 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:49:10,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:49:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-02-10 20:49:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:49:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-02-10 20:49:10,239 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-02-10 20:49:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:10,239 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-02-10 20:49:10,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-02-10 20:49:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:10,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:10,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-02-10 20:49:10,240 INFO L427 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-02-10 20:49:10,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:10,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2048407589, now seen corresponding path program 877 times [2020-02-10 20:49:10,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:10,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103865726] [2020-02-10 20:49:10,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:10,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103865726] [2020-02-10 20:49:10,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:10,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:10,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342504294] [2020-02-10 20:49:10,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:10,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:10,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:10,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:10,613 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:49:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:10,756 INFO L93 Difference]: Finished difference Result 1184 states and 4201 transitions. [2020-02-10 20:49:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:10,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:10,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:10,760 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:49:10,760 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:49:10,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:49:10,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 778. [2020-02-10 20:49:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:49:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 20:49:10,783 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 20:49:10,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:10,783 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 20:49:10,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 20:49:10,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:10,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:10,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:10,784 INFO L427 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-02-10 20:49:10,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:10,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1265804989, now seen corresponding path program 878 times [2020-02-10 20:49:10,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:10,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752467988] [2020-02-10 20:49:10,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:11,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752467988] [2020-02-10 20:49:11,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:11,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:11,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29285211] [2020-02-10 20:49:11,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:11,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:11,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:11,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:11,158 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:49:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:11,302 INFO L93 Difference]: Finished difference Result 1183 states and 4196 transitions. [2020-02-10 20:49:11,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:11,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:11,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:11,306 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:49:11,306 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:49:11,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-02-10 20:49:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:49:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 20:49:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-02-10 20:49:11,328 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-02-10 20:49:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:11,328 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-02-10 20:49:11,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-02-10 20:49:11,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:11,329 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:11,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-02-10 20:49:11,329 INFO L427 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-02-10 20:49:11,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:11,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1162609309, now seen corresponding path program 879 times [2020-02-10 20:49:11,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:11,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320912052] [2020-02-10 20:49:11,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:11,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-02-10 20:49:11,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320912052] [2020-02-10 20:49:11,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:11,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:11,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175002261] [2020-02-10 20:49:11,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:11,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:11,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:11,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:11,700 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:49:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:11,835 INFO L93 Difference]: Finished difference Result 1182 states and 4194 transitions. [2020-02-10 20:49:11,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:11,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:11,839 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:49:11,839 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:49:11,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:49:11,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 20:49:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 20:49:11,862 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 20:49:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:11,862 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 20:49:11,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 20:49:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:11,863 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:11,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-02-10 20:49:11,863 INFO L427 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-02-10 20:49:11,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:11,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2109590853, now seen corresponding path program 880 times [2020-02-10 20:49:11,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:11,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649248457] [2020-02-10 20:49:11,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:12,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649248457] [2020-02-10 20:49:12,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:12,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:12,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337450086] [2020-02-10 20:49:12,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:12,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:12,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:12,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:12,248 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:49:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:12,386 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-02-10 20:49:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:12,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:12,390 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:49:12,390 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:49:12,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:49:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-02-10 20:49:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:49:12,413 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:49:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:12,413 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:49:12,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:49:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:12,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:12,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-02-10 20:49:12,415 INFO L427 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-02-10 20:49:12,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:12,415 INFO L82 PathProgramCache]: Analyzing trace with hash 375205093, now seen corresponding path program 881 times [2020-02-10 20:49:12,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:12,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502917279] [2020-02-10 20:49:12,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:12,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502917279] [2020-02-10 20:49:12,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:12,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:12,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137676760] [2020-02-10 20:49:12,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:12,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:12,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:12,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:12,786 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:49:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:12,927 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-02-10 20:49:12,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:12,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:12,931 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:49:12,931 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:49:12,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-02-10 20:49:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:49:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 20:49:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:49:12,953 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:49:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:12,954 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:49:12,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:49:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:12,955 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:12,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-02-10 20:49:12,955 INFO L427 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-02-10 20:49:12,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:12,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1770965667, now seen corresponding path program 882 times [2020-02-10 20:49:12,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:12,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762232457] [2020-02-10 20:49:12,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:13,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762232457] [2020-02-10 20:49:13,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:13,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:13,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556159055] [2020-02-10 20:49:13,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:13,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:13,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:13,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:13,332 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:49:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:13,475 INFO L93 Difference]: Finished difference Result 1179 states and 4184 transitions. [2020-02-10 20:49:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:13,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:13,478 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:49:13,478 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 20:49:13,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:13,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 20:49:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 773. [2020-02-10 20:49:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:49:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 20:49:13,501 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 20:49:13,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:13,501 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 20:49:13,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 20:49:13,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:13,502 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:13,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-02-10 20:49:13,502 INFO L427 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-02-10 20:49:13,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:13,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1419583365, now seen corresponding path program 883 times [2020-02-10 20:49:13,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:13,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128077622] [2020-02-10 20:49:13,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:13,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128077622] [2020-02-10 20:49:13,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:13,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:13,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593882138] [2020-02-10 20:49:13,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:13,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:13,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:13,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:13,877 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:49:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:14,011 INFO L93 Difference]: Finished difference Result 1190 states and 4211 transitions. [2020-02-10 20:49:14,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:14,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:14,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:14,015 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:49:14,015 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:49:14,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-02-10 20:49:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:49:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 778. [2020-02-10 20:49:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:49:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-02-10 20:49:14,038 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-02-10 20:49:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:14,038 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-02-10 20:49:14,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-02-10 20:49:14,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:14,039 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:14,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-02-10 20:49:14,039 INFO L427 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-02-10 20:49:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:14,039 INFO L82 PathProgramCache]: Analyzing trace with hash 191357593, now seen corresponding path program 884 times [2020-02-10 20:49:14,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:14,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368639] [2020-02-10 20:49:14,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:14,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368639] [2020-02-10 20:49:14,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:14,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:14,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644921045] [2020-02-10 20:49:14,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:14,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:14,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:14,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:14,420 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:49:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:14,589 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-02-10 20:49:14,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:14,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:14,593 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:49:14,593 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:49:14,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:49:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 775. [2020-02-10 20:49:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:49:14,615 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:49:14,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:14,615 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:49:14,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:49:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:14,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:14,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:14,616 INFO L427 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-02-10 20:49:14,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:14,617 INFO L82 PathProgramCache]: Analyzing trace with hash 768599811, now seen corresponding path program 885 times [2020-02-10 20:49:14,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:14,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598296341] [2020-02-10 20:49:14,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49: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-02-10 20:49:14,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598296341] [2020-02-10 20:49:14,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:14,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:14,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37513507] [2020-02-10 20:49:14,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:14,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:14,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:14,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:14,990 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:49:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:15,124 INFO L93 Difference]: Finished difference Result 1188 states and 4204 transitions. [2020-02-10 20:49:15,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:15,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:15,128 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:49:15,128 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:49:15,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:49:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 777. [2020-02-10 20:49:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:49:15,151 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:49:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:15,151 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:49:15,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:15,151 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:49:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:15,152 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:15,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-02-10 20:49:15,152 INFO L427 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-02-10 20:49:15,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:15,153 INFO L82 PathProgramCache]: Analyzing trace with hash 233370009, now seen corresponding path program 886 times [2020-02-10 20:49:15,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:15,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003793976] [2020-02-10 20:49:15,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:15,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003793976] [2020-02-10 20:49:15,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:15,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:15,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904191476] [2020-02-10 20:49:15,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:15,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:15,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:15,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:15,517 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:49:15,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:15,654 INFO L93 Difference]: Finished difference Result 1184 states and 4194 transitions. [2020-02-10 20:49:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:15,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:15,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:15,658 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:49:15,658 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:49:15,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:15,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:49:15,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 20:49:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:49:15,681 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:49:15,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:15,681 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:49:15,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:15,681 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:49:15,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:15,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:15,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:15,682 INFO L427 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-02-10 20:49:15,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:15,683 INFO L82 PathProgramCache]: Analyzing trace with hash 779102915, now seen corresponding path program 887 times [2020-02-10 20:49:15,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:15,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602315330] [2020-02-10 20:49:15,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49: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-02-10 20:49:16,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602315330] [2020-02-10 20:49:16,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:16,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:16,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530592994] [2020-02-10 20:49:16,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:16,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:16,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:16,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:16,053 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:49:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:16,191 INFO L93 Difference]: Finished difference Result 1182 states and 4190 transitions. [2020-02-10 20:49:16,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:16,192 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:16,195 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:49:16,195 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:49:16,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:16,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:49:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:49:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:49:16,218 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:49:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:16,218 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:49:16,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:49:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:16,219 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:16,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-02-10 20:49:16,220 INFO L427 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-02-10 20:49:16,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:16,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1367067845, now seen corresponding path program 888 times [2020-02-10 20:49:16,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:16,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108997136] [2020-02-10 20:49:16,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:16,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108997136] [2020-02-10 20:49:16,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:16,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:16,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873363049] [2020-02-10 20:49:16,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:16,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:16,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:16,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:16,606 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:49:16,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:16,751 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-02-10 20:49:16,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:16,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:16,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:16,755 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:49:16,755 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 20:49:16,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 20:49:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 771. [2020-02-10 20:49:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:49:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3083 transitions. [2020-02-10 20:49:16,778 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3083 transitions. Word has length 25 [2020-02-10 20:49:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:16,778 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3083 transitions. [2020-02-10 20:49:16,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3083 transitions. [2020-02-10 20:49:16,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:16,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:16,779 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:16,779 INFO L427 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-02-10 20:49:16,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:16,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1600160797, now seen corresponding path program 889 times [2020-02-10 20:49:16,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:16,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255980415] [2020-02-10 20:49:16,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:17,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255980415] [2020-02-10 20:49:17,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:17,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:17,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205071647] [2020-02-10 20:49:17,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:17,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:17,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:17,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:17,161 INFO L87 Difference]: Start difference. First operand 771 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:49:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:17,311 INFO L93 Difference]: Finished difference Result 1214 states and 4281 transitions. [2020-02-10 20:49:17,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:17,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:17,315 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:49:17,315 INFO L226 Difference]: Without dead ends: 1201 [2020-02-10 20:49:17,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-02-10 20:49:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-02-10 20:49:17,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 781. [2020-02-10 20:49:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:49:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3114 transitions. [2020-02-10 20:49:17,337 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3114 transitions. Word has length 25 [2020-02-10 20:49:17,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:17,337 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3114 transitions. [2020-02-10 20:49:17,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3114 transitions. [2020-02-10 20:49:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:17,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:17,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-02-10 20:49:17,339 INFO L427 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-02-10 20:49:17,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:17,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1724554885, now seen corresponding path program 890 times [2020-02-10 20:49:17,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:17,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834506763] [2020-02-10 20:49:17,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:17,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834506763] [2020-02-10 20:49:17,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:17,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:17,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843209058] [2020-02-10 20:49:17,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:17,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:17,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:17,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:17,700 INFO L87 Difference]: Start difference. First operand 781 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:49:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:17,838 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 20:49:17,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:17,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:17,847 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:49:17,847 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 20:49:17,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-02-10 20:49:17,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 20:49:17,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 777. [2020-02-10 20:49:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3103 transitions. [2020-02-10 20:49:17,877 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3103 transitions. Word has length 25 [2020-02-10 20:49:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:17,877 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3103 transitions. [2020-02-10 20:49:17,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3103 transitions. [2020-02-10 20:49:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:17,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:17,879 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:17,879 INFO L427 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-02-10 20:49:17,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:17,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1157261657, now seen corresponding path program 891 times [2020-02-10 20:49:17,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:17,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986303589] [2020-02-10 20:49:17,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:18,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986303589] [2020-02-10 20:49:18,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:18,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:18,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275025532] [2020-02-10 20:49:18,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:18,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:18,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:18,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:18,225 INFO L87 Difference]: Start difference. First operand 777 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:49:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:18,363 INFO L93 Difference]: Finished difference Result 1215 states and 4279 transitions. [2020-02-10 20:49:18,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:18,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:18,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:18,367 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:49:18,367 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:49:18,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:18,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:49:18,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 781. [2020-02-10 20:49:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:49:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:49:18,390 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:49:18,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:18,390 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:49:18,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:18,390 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:49:18,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:18,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:18,391 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:18,392 INFO L427 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-02-10 20:49:18,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:18,392 INFO L82 PathProgramCache]: Analyzing trace with hash -2146447817, now seen corresponding path program 892 times [2020-02-10 20:49:18,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:18,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976914327] [2020-02-10 20:49:18,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:18,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976914327] [2020-02-10 20:49:18,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:18,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:18,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299276157] [2020-02-10 20:49:18,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:18,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:18,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:18,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:18,750 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:49:18,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:18,894 INFO L93 Difference]: Finished difference Result 1218 states and 4281 transitions. [2020-02-10 20:49:18,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:18,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:18,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:18,897 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 20:49:18,898 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:49:18,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-02-10 20:49:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:49:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-02-10 20:49:18,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3099 transitions. [2020-02-10 20:49:18,920 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3099 transitions. Word has length 25 [2020-02-10 20:49:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:18,921 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3099 transitions. [2020-02-10 20:49:18,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:18,921 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3099 transitions. [2020-02-10 20:49:18,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:18,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:18,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-02-10 20:49:18,922 INFO L427 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-02-10 20:49:18,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:18,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1060333475, now seen corresponding path program 893 times [2020-02-10 20:49:18,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:18,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326666506] [2020-02-10 20:49:18,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:19,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326666506] [2020-02-10 20:49:19,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:19,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:19,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073861820] [2020-02-10 20:49:19,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:19,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:19,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:19,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:19,269 INFO L87 Difference]: Start difference. First operand 777 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:49:19,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:19,423 INFO L93 Difference]: Finished difference Result 1221 states and 4289 transitions. [2020-02-10 20:49:19,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:19,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:19,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:19,426 INFO L225 Difference]: With dead ends: 1221 [2020-02-10 20:49:19,427 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 20:49:19,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-02-10 20:49:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 20:49:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 783. [2020-02-10 20:49:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:49:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3110 transitions. [2020-02-10 20:49:19,449 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3110 transitions. Word has length 25 [2020-02-10 20:49:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:19,449 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3110 transitions. [2020-02-10 20:49:19,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3110 transitions. [2020-02-10 20:49:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:19,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:19,451 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:19,451 INFO L427 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-02-10 20:49:19,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:19,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2133418855, now seen corresponding path program 894 times [2020-02-10 20:49:19,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:19,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025423053] [2020-02-10 20:49:19,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:19,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025423053] [2020-02-10 20:49:19,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:19,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:19,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505368882] [2020-02-10 20:49:19,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:19,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:19,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:19,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:19,815 INFO L87 Difference]: Start difference. First operand 783 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:49:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:19,946 INFO L93 Difference]: Finished difference Result 1222 states and 4285 transitions. [2020-02-10 20:49:19,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:19,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:19,949 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 20:49:19,949 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:49:19,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:49:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 773. [2020-02-10 20:49:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:49:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-02-10 20:49:19,972 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-02-10 20:49:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:19,972 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-02-10 20:49:19,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-02-10 20:49:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:19,973 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:19,973 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:19,973 INFO L427 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-02-10 20:49:19,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:19,973 INFO L82 PathProgramCache]: Analyzing trace with hash 332703619, now seen corresponding path program 895 times [2020-02-10 20:49:19,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:19,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024711857] [2020-02-10 20:49:19,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:20,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024711857] [2020-02-10 20:49:20,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:20,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:20,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059750255] [2020-02-10 20:49:20,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:20,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:20,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:20,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:20,308 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:49:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:20,447 INFO L93 Difference]: Finished difference Result 1201 states and 4243 transitions. [2020-02-10 20:49:20,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:20,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:20,450 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 20:49:20,450 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:49:20,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:49:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 779. [2020-02-10 20:49:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:49:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 20:49:20,473 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 20:49:20,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:20,473 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 20:49:20,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 20:49:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:20,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:20,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:20,474 INFO L427 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-02-10 20:49:20,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:20,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1302955233, now seen corresponding path program 896 times [2020-02-10 20:49:20,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:20,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591588911] [2020-02-10 20:49:20,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:20,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591588911] [2020-02-10 20:49:20,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:20,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:20,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789461193] [2020-02-10 20:49:20,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:20,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:20,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:20,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:20,811 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:49:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:20,948 INFO L93 Difference]: Finished difference Result 1203 states and 4243 transitions. [2020-02-10 20:49:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:20,949 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:20,952 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 20:49:20,952 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:49:20,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:49:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 775. [2020-02-10 20:49:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-02-10 20:49:20,975 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-02-10 20:49:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:20,975 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-02-10 20:49:20,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-02-10 20:49:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:20,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:20,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-02-10 20:49:20,976 INFO L427 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-02-10 20:49:20,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:20,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1372939417, now seen corresponding path program 897 times [2020-02-10 20:49:20,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:20,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938691199] [2020-02-10 20:49:20,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:21,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938691199] [2020-02-10 20:49:21,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:21,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:21,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159069141] [2020-02-10 20:49:21,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:21,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:21,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:21,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:21,354 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:49:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:21,492 INFO L93 Difference]: Finished difference Result 1195 states and 4227 transitions. [2020-02-10 20:49:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:21,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:21,495 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:49:21,495 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:49:21,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:49:21,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-02-10 20:49:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 20:49:21,518 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 20:49:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:21,519 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 20:49:21,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 20:49:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:21,520 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:21,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-02-10 20:49:21,520 INFO L427 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-02-10 20:49:21,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:21,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1899260745, now seen corresponding path program 898 times [2020-02-10 20:49:21,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:21,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002956788] [2020-02-10 20:49:21,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:21,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002956788] [2020-02-10 20:49:21,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:21,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:21,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863247699] [2020-02-10 20:49:21,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:21,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:21,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:21,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:21,885 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:49:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:22,026 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-02-10 20:49:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:22,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:22,029 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:49:22,029 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:49:22,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-02-10 20:49:22,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:49:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 775. [2020-02-10 20:49:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:49:22,052 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:49:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:22,053 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:49:22,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:49:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:22,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:22,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-02-10 20:49:22,054 INFO L427 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-02-10 20:49:22,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:22,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1351001981, now seen corresponding path program 899 times [2020-02-10 20:49:22,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:22,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115833123] [2020-02-10 20:49:22,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:22,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115833123] [2020-02-10 20:49:22,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:22,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:22,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524560751] [2020-02-10 20:49:22,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:22,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:22,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:22,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:22,381 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:49:22,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:22,548 INFO L93 Difference]: Finished difference Result 1199 states and 4233 transitions. [2020-02-10 20:49:22,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:22,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:22,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:22,551 INFO L225 Difference]: With dead ends: 1199 [2020-02-10 20:49:22,552 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:49:22,552 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:49:22,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 777. [2020-02-10 20:49:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:49:22,574 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:49:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:22,575 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:49:22,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:49:22,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:22,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:22,576 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:22,576 INFO L427 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-02-10 20:49:22,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:22,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1886231783, now seen corresponding path program 900 times [2020-02-10 20:49:22,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:22,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043608212] [2020-02-10 20:49:22,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:22,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043608212] [2020-02-10 20:49:22,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:22,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:22,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538888072] [2020-02-10 20:49:22,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:22,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:22,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:22,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:22,911 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:49:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:23,050 INFO L93 Difference]: Finished difference Result 1195 states and 4223 transitions. [2020-02-10 20:49:23,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:23,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:23,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:23,054 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:49:23,054 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:49:23,054 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:49:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 773. [2020-02-10 20:49:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:49:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 20:49:23,077 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 20:49:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:23,077 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 20:49:23,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 20:49:23,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:23,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:23,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-02-10 20:49:23,079 INFO L427 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-02-10 20:49:23,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:23,079 INFO L82 PathProgramCache]: Analyzing trace with hash -955166973, now seen corresponding path program 901 times [2020-02-10 20:49:23,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:23,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629823565] [2020-02-10 20:49:23,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:23,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629823565] [2020-02-10 20:49:23,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:23,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:23,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496285323] [2020-02-10 20:49:23,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:23,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:23,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:23,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:23,427 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:49:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:23,588 INFO L93 Difference]: Finished difference Result 1203 states and 4245 transitions. [2020-02-10 20:49:23,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:23,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:23,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:23,592 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 20:49:23,592 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:49:23,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:49:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 779. [2020-02-10 20:49:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:49:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 20:49:23,615 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 20:49:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:23,615 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 20:49:23,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 20:49:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:23,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:23,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:23,616 INFO L427 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-02-10 20:49:23,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:23,616 INFO L82 PathProgramCache]: Analyzing trace with hash 36090849, now seen corresponding path program 902 times [2020-02-10 20:49:23,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:23,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778942060] [2020-02-10 20:49:23,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:23,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778942060] [2020-02-10 20:49:23,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:23,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:23,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014184291] [2020-02-10 20:49:23,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:23,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:23,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:23,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:23,957 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:49:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:24,100 INFO L93 Difference]: Finished difference Result 1206 states and 4247 transitions. [2020-02-10 20:49:24,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:24,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:24,103 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:49:24,103 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:49:24,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:49:24,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 775. [2020-02-10 20:49:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:49:24,126 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:49:24,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:24,126 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:49:24,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:49:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:24,127 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:24,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-02-10 20:49:24,127 INFO L427 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-02-10 20:49:24,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:24,128 INFO L82 PathProgramCache]: Analyzing trace with hash 527967965, now seen corresponding path program 903 times [2020-02-10 20:49:24,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:24,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688190677] [2020-02-10 20:49:24,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:24,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688190677] [2020-02-10 20:49:24,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:24,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:24,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833009565] [2020-02-10 20:49:24,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:24,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:24,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:24,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:24,494 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:49:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:24,634 INFO L93 Difference]: Finished difference Result 1196 states and 4227 transitions. [2020-02-10 20:49:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:24,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:24,638 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:49:24,638 INFO L226 Difference]: Without dead ends: 1183 [2020-02-10 20:49:24,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-02-10 20:49:24,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 777. [2020-02-10 20:49:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:49:24,660 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:49:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:24,661 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:49:24,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:49:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:24,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:24,662 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:24,662 INFO L427 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-02-10 20:49:24,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:24,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1550735099, now seen corresponding path program 904 times [2020-02-10 20:49:24,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:24,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899107148] [2020-02-10 20:49:24,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:25,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899107148] [2020-02-10 20:49:25,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:25,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:25,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875663212] [2020-02-10 20:49:25,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:25,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:25,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:25,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:25,011 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:49:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:25,153 INFO L93 Difference]: Finished difference Result 1194 states and 4221 transitions. [2020-02-10 20:49:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:25,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:25,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:25,157 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:49:25,157 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:49:25,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:49:25,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-02-10 20:49:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:49:25,180 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:49:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:25,180 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:49:25,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:49:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:25,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:25,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:25,182 INFO L427 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-02-10 20:49:25,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:25,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1677100931, now seen corresponding path program 905 times [2020-02-10 20:49:25,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:25,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056289981] [2020-02-10 20:49:25,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:25,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056289981] [2020-02-10 20:49:25,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:25,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:25,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252527442] [2020-02-10 20:49:25,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:25,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:25,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:25,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:25,529 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:49:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:25,687 INFO L93 Difference]: Finished difference Result 1202 states and 4237 transitions. [2020-02-10 20:49:25,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:25,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:25,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:25,690 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:49:25,690 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:49:25,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:25,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:49:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-02-10 20:49:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:49:25,713 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:49:25,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:25,713 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:49:25,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:25,713 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:49:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:25,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:25,714 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:25,715 INFO L427 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-02-10 20:49:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:25,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2080010787, now seen corresponding path program 906 times [2020-02-10 20:49:25,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:25,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940609963] [2020-02-10 20:49:25,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:26,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940609963] [2020-02-10 20:49:26,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:26,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:26,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506928764] [2020-02-10 20:49:26,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:26,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:26,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:26,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:26,059 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:49:26,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:26,220 INFO L93 Difference]: Finished difference Result 1197 states and 4225 transitions. [2020-02-10 20:49:26,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:26,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:26,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:26,224 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 20:49:26,224 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:49:26,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:49:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-02-10 20:49:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:49:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:49:26,246 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:49:26,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:26,246 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:49:26,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:49:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:26,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:26,247 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:26,247 INFO L427 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-02-10 20:49:26,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1728628485, now seen corresponding path program 907 times [2020-02-10 20:49:26,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:26,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534997840] [2020-02-10 20:49:26,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:26,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534997840] [2020-02-10 20:49:26,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:26,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:26,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475347743] [2020-02-10 20:49:26,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:26,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:26,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:26,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:26,592 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:49:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:26,731 INFO L93 Difference]: Finished difference Result 1213 states and 4267 transitions. [2020-02-10 20:49:26,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:26,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:26,735 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:49:26,735 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:49:26,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:26,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:49:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 781. [2020-02-10 20:49:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:49:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 20:49:26,758 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 20:49:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:26,758 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 20:49:26,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 20:49:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:26,759 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:26,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-02-10 20:49:26,760 INFO L427 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-02-10 20:49:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:26,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1493253431, now seen corresponding path program 908 times [2020-02-10 20:49:26,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:26,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25969737] [2020-02-10 20:49:26,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:27,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25969737] [2020-02-10 20:49:27,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:27,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:27,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571867670] [2020-02-10 20:49:27,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:27,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:27,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:27,126 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:49:27,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:27,262 INFO L93 Difference]: Finished difference Result 1214 states and 4263 transitions. [2020-02-10 20:49:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:27,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:27,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:27,266 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:49:27,266 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:49:27,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:49:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-02-10 20:49:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:49:27,289 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:49:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:27,289 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:49:27,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:49:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:27,290 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:27,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-02-10 20:49:27,291 INFO L427 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-02-10 20:49:27,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:27,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2059992545, now seen corresponding path program 909 times [2020-02-10 20:49:27,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:27,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129620816] [2020-02-10 20:49:27,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:27,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129620816] [2020-02-10 20:49:27,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:27,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:27,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001393943] [2020-02-10 20:49:27,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:27,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:27,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:27,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:27,623 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:49:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:27,770 INFO L93 Difference]: Finished difference Result 1204 states and 4243 transitions. [2020-02-10 20:49:27,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:27,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:27,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:27,773 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:49:27,773 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 20:49:27,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 20:49:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 777. [2020-02-10 20:49:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:49:27,797 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:49:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:27,797 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:49:27,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:49:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:27,798 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:27,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-02-10 20:49:27,798 INFO L427 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-02-10 20:49:27,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1524762743, now seen corresponding path program 910 times [2020-02-10 20:49:27,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:27,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800264919] [2020-02-10 20:49:27,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:28,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800264919] [2020-02-10 20:49:28,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:28,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:28,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123689615] [2020-02-10 20:49:28,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:28,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:28,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:28,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:28,134 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:49:28,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:28,295 INFO L93 Difference]: Finished difference Result 1200 states and 4233 transitions. [2020-02-10 20:49:28,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:28,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:28,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:28,299 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:49:28,299 INFO L226 Difference]: Without dead ends: 1187 [2020-02-10 20:49:28,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-02-10 20:49:28,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 775. [2020-02-10 20:49:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:49:28,322 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:49:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:28,322 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:49:28,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:49:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:28,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:28,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:28,324 INFO L427 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-02-10 20:49:28,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:28,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2080998753, now seen corresponding path program 911 times [2020-02-10 20:49:28,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:28,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030885546] [2020-02-10 20:49:28,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:28,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030885546] [2020-02-10 20:49:28,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:28,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:28,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547650378] [2020-02-10 20:49:28,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:28,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:28,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:28,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:28,672 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:49:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:28,821 INFO L93 Difference]: Finished difference Result 1206 states and 4245 transitions. [2020-02-10 20:49:28,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:28,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:28,825 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:49:28,825 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:49:28,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:49:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 20:49:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:49:28,848 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:49:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:28,848 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:49:28,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:49:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:28,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:28,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:28,849 INFO L427 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-02-10 20:49:28,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:28,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1676112965, now seen corresponding path program 912 times [2020-02-10 20:49:28,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:28,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321773271] [2020-02-10 20:49:28,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:29,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321773271] [2020-02-10 20:49:29,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:29,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:29,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121974263] [2020-02-10 20:49:29,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:29,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:29,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:29,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:29,201 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:49:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:29,362 INFO L93 Difference]: Finished difference Result 1201 states and 4233 transitions. [2020-02-10 20:49:29,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:29,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:29,366 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 20:49:29,366 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:49:29,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:29,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:49:29,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 771. [2020-02-10 20:49:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:49:29,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-02-10 20:49:29,389 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-02-10 20:49:29,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:29,389 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-02-10 20:49:29,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-02-10 20:49:29,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:29,390 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:29,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-02-10 20:49:29,390 INFO L427 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-02-10 20:49:29,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:29,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1403413765, now seen corresponding path program 913 times [2020-02-10 20:49:29,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:29,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300951437] [2020-02-10 20:49:29,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:29,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300951437] [2020-02-10 20:49:29,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:29,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:29,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48129892] [2020-02-10 20:49:29,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:29,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:29,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:29,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:29,787 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-02-10 20:49:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:29,934 INFO L93 Difference]: Finished difference Result 1194 states and 4226 transitions. [2020-02-10 20:49:29,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:29,935 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:29,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:29,938 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:49:29,938 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:49:29,938 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:49:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-02-10 20:49:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:49:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3106 transitions. [2020-02-10 20:49:29,962 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3106 transitions. Word has length 25 [2020-02-10 20:49:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:29,962 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3106 transitions. [2020-02-10 20:49:29,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3106 transitions. [2020-02-10 20:49:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:29,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:29,963 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:29,963 INFO L427 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-02-10 20:49:29,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:29,963 INFO L82 PathProgramCache]: Analyzing trace with hash -422659047, now seen corresponding path program 914 times [2020-02-10 20:49:29,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:29,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662383589] [2020-02-10 20:49:29,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:30,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662383589] [2020-02-10 20:49:30,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:30,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:30,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199193693] [2020-02-10 20:49:30,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:30,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:30,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:30,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:30,336 INFO L87 Difference]: Start difference. First operand 779 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:49:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:30,498 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-02-10 20:49:30,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:30,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:30,501 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:49:30,501 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:49:30,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-02-10 20:49:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:49:30,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 776. [2020-02-10 20:49:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:49:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3098 transitions. [2020-02-10 20:49:30,523 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3098 transitions. Word has length 25 [2020-02-10 20:49:30,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:30,523 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3098 transitions. [2020-02-10 20:49:30,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3098 transitions. [2020-02-10 20:49:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:30,525 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:30,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-02-10 20:49:30,525 INFO L427 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-02-10 20:49:30,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:30,525 INFO L82 PathProgramCache]: Analyzing trace with hash 522620313, now seen corresponding path program 915 times [2020-02-10 20:49:30,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:30,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58695037] [2020-02-10 20:49:30,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:30,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58695037] [2020-02-10 20:49:30,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:30,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:30,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520024029] [2020-02-10 20:49:30,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:30,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:30,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:30,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:30,899 INFO L87 Difference]: Start difference. First operand 776 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:49:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:31,035 INFO L93 Difference]: Finished difference Result 1199 states and 4234 transitions. [2020-02-10 20:49:31,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:31,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:31,039 INFO L225 Difference]: With dead ends: 1199 [2020-02-10 20:49:31,039 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:49:31,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-02-10 20:49:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:49:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 780. [2020-02-10 20:49:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:49:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-02-10 20:49:31,062 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-02-10 20:49:31,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:31,062 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-02-10 20:49:31,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-02-10 20:49:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:31,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:31,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-02-10 20:49:31,063 INFO L427 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-02-10 20:49:31,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:31,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1513878135, now seen corresponding path program 916 times [2020-02-10 20:49:31,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:31,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727875070] [2020-02-10 20:49:31,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49: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-02-10 20:49:31,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727875070] [2020-02-10 20:49:31,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:31,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:31,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766592729] [2020-02-10 20:49:31,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:31,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:31,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:31,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:31,432 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:49:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:31,574 INFO L93 Difference]: Finished difference Result 1202 states and 4236 transitions. [2020-02-10 20:49:31,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:31,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:31,577 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:49:31,577 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:49:31,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:49:31,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 776. [2020-02-10 20:49:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:49:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3095 transitions. [2020-02-10 20:49:31,600 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3095 transitions. Word has length 25 [2020-02-10 20:49:31,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:31,600 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3095 transitions. [2020-02-10 20:49:31,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3095 transitions. [2020-02-10 20:49:31,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:31,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:31,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-02-10 20:49:31,601 INFO L427 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-02-10 20:49:31,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:31,602 INFO L82 PathProgramCache]: Analyzing trace with hash 241562363, now seen corresponding path program 917 times [2020-02-10 20:49:31,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:31,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906380848] [2020-02-10 20:49:31,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:31,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906380848] [2020-02-10 20:49:31,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:31,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:31,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469989594] [2020-02-10 20:49:31,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:31,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:31,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:31,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:31,973 INFO L87 Difference]: Start difference. First operand 776 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:49:32,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:32,110 INFO L93 Difference]: Finished difference Result 1196 states and 4224 transitions. [2020-02-10 20:49:32,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:32,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:32,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:32,113 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:49:32,114 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:49:32,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-02-10 20:49:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:49:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 779. [2020-02-10 20:49:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:49:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 20:49:32,136 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 20:49:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:32,137 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 20:49:32,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 20:49:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:32,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:32,138 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:32,138 INFO L427 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-02-10 20:49:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:32,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1852503321, now seen corresponding path program 918 times [2020-02-10 20:49:32,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:32,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085042161] [2020-02-10 20:49:32,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:32,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085042161] [2020-02-10 20:49:32,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:32,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:32,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954606219] [2020-02-10 20:49:32,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:32,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:32,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:32,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:32,498 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:49:32,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:32,653 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-02-10 20:49:32,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:32,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:32,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:32,656 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:49:32,656 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:49:32,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-02-10 20:49:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:49:32,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 773. [2020-02-10 20:49:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:49:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 20:49:32,679 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 20:49:32,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:32,679 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 20:49:32,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:32,679 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 20:49:32,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:32,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:32,680 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:32,680 INFO L427 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-02-10 20:49:32,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:32,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1624096353, now seen corresponding path program 919 times [2020-02-10 20:49:32,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:32,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674252563] [2020-02-10 20:49:32,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:33,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674252563] [2020-02-10 20:49:33,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:33,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:33,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678505427] [2020-02-10 20:49:33,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:33,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:33,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:33,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:33,048 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:49:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:33,185 INFO L93 Difference]: Finished difference Result 1185 states and 4201 transitions. [2020-02-10 20:49:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:33,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:33,188 INFO L225 Difference]: With dead ends: 1185 [2020-02-10 20:49:33,189 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:49:33,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:33,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:49:33,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-02-10 20:49:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:49:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-02-10 20:49:33,212 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-02-10 20:49:33,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:33,212 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-02-10 20:49:33,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:33,212 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-02-10 20:49:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:33,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:33,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:33,213 INFO L427 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-02-10 20:49:33,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:33,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1690116225, now seen corresponding path program 920 times [2020-02-10 20:49:33,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:33,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403490272] [2020-02-10 20:49:33,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:33,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403490272] [2020-02-10 20:49:33,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:33,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:33,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241349542] [2020-02-10 20:49:33,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:33,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:33,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:33,614 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:49:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:33,752 INFO L93 Difference]: Finished difference Result 1184 states and 4196 transitions. [2020-02-10 20:49:33,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:33,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:33,755 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:49:33,756 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:49:33,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-02-10 20:49:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:49:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-02-10 20:49:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:49:33,779 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:49:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:33,779 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:49:33,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:49:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:33,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:33,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-02-10 20:49:33,780 INFO L427 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-02-10 20:49:33,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash 738298073, now seen corresponding path program 921 times [2020-02-10 20:49:33,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:33,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481320971] [2020-02-10 20:49:33,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:34,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481320971] [2020-02-10 20:49:34,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:34,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:34,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868958550] [2020-02-10 20:49:34,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:34,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:34,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:34,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:34,152 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:49:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:34,293 INFO L93 Difference]: Finished difference Result 1183 states and 4194 transitions. [2020-02-10 20:49:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:34,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:34,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:34,297 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:49:34,297 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:49:34,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-02-10 20:49:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:49:34,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:49:34,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:34,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:49:34,320 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:49:34,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:34,320 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:49:34,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:34,320 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:49:34,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:34,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:34,321 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:34,321 INFO L427 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-02-10 20:49:34,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:34,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1761065207, now seen corresponding path program 922 times [2020-02-10 20:49:34,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:34,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19542809] [2020-02-10 20:49:34,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:34,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19542809] [2020-02-10 20:49:34,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:34,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:34,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305161246] [2020-02-10 20:49:34,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:34,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:34,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:34,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:34,701 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:49:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:34,877 INFO L93 Difference]: Finished difference Result 1181 states and 4188 transitions. [2020-02-10 20:49:34,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:34,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:34,880 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:49:34,880 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:49:34,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:49:34,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 20:49:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:49:34,902 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:49:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:34,902 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:49:34,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:34,903 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:49:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:34,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:34,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-02-10 20:49:34,904 INFO L427 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-02-10 20:49:34,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:34,904 INFO L82 PathProgramCache]: Analyzing trace with hash -49106143, now seen corresponding path program 923 times [2020-02-10 20:49:34,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:34,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435076215] [2020-02-10 20:49:34,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:35,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-02-10 20:49:35,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435076215] [2020-02-10 20:49:35,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:35,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:35,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022202249] [2020-02-10 20:49:35,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:35,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:35,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:35,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:35,281 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:49:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:35,442 INFO L93 Difference]: Finished difference Result 1181 states and 4188 transitions. [2020-02-10 20:49:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:35,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:35,445 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:49:35,446 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:49:35,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-02-10 20:49:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:49:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 20:49:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:49:35,468 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:49:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:35,468 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:49:35,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:49:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:35,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:35,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-02-10 20:49:35,469 INFO L427 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-02-10 20:49:35,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:35,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2099690393, now seen corresponding path program 924 times [2020-02-10 20:49:35,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:35,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274554495] [2020-02-10 20:49:35,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:35,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274554495] [2020-02-10 20:49:35,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:35,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:35,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775513715] [2020-02-10 20:49:35,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:35,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:35,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:35,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:35,849 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:49:36,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:36,022 INFO L93 Difference]: Finished difference Result 1180 states and 4184 transitions. [2020-02-10 20:49:36,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:36,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:36,026 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:49:36,026 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:49:36,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-02-10 20:49:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:49:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-02-10 20:49:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:49:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:49:36,049 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:49:36,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:36,049 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:49:36,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:36,049 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:49:36,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:36,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:36,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-02-10 20:49:36,050 INFO L427 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-02-10 20:49:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1167322591, now seen corresponding path program 925 times [2020-02-10 20:49:36,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:36,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768713461] [2020-02-10 20:49:36,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:36,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768713461] [2020-02-10 20:49:36,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:36,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:36,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403846448] [2020-02-10 20:49:36,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:36,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:36,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:36,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:36,418 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:49:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:36,567 INFO L93 Difference]: Finished difference Result 1195 states and 4221 transitions. [2020-02-10 20:49:36,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:36,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:36,571 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:49:36,571 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:49:36,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:36,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:49:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 20:49:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:49:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 20:49:36,594 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 20:49:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:36,594 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 20:49:36,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 20:49:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:36,595 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:36,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-02-10 20:49:36,595 INFO L427 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-02-10 20:49:36,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:36,596 INFO L82 PathProgramCache]: Analyzing trace with hash -176064769, now seen corresponding path program 926 times [2020-02-10 20:49:36,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:36,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126912802] [2020-02-10 20:49:36,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:36,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-02-10 20:49:36,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126912802] [2020-02-10 20:49:36,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:36,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:36,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27163620] [2020-02-10 20:49:36,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:36,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:36,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:36,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:36,956 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:49:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:37,148 INFO L93 Difference]: Finished difference Result 1198 states and 4223 transitions. [2020-02-10 20:49:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:37,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:37,152 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 20:49:37,152 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:49:37,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:37,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:49:37,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 20:49:37,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:49:37,175 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:49:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:37,175 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:49:37,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:49:37,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:37,176 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:37,176 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:37,176 INFO L427 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-02-10 20:49:37,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:37,176 INFO L82 PathProgramCache]: Analyzing trace with hash 315812347, now seen corresponding path program 927 times [2020-02-10 20:49:37,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:37,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016830180] [2020-02-10 20:49:37,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:37,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016830180] [2020-02-10 20:49:37,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:37,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:37,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434173384] [2020-02-10 20:49:37,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:37,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:37,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:37,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:37,544 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:49:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:37,690 INFO L93 Difference]: Finished difference Result 1188 states and 4203 transitions. [2020-02-10 20:49:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:37,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:37,694 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:49:37,694 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:49:37,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:49:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 20:49:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:49:37,717 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:49:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:37,717 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:49:37,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:49:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:37,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:37,719 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:37,719 INFO L427 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-02-10 20:49:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:37,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1338579481, now seen corresponding path program 928 times [2020-02-10 20:49:37,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:37,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120612871] [2020-02-10 20:49:37,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:38,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120612871] [2020-02-10 20:49:38,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:38,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:38,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802841376] [2020-02-10 20:49:38,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:38,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:38,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:38,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:38,082 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:49:38,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:38,232 INFO L93 Difference]: Finished difference Result 1186 states and 4197 transitions. [2020-02-10 20:49:38,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:38,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:38,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:38,236 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:49:38,236 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:49:38,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:38,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:49:38,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-02-10 20:49:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:49:38,278 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:49:38,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:38,278 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:49:38,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:49:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:38,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:38,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-02-10 20:49:38,280 INFO L427 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-02-10 20:49:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:38,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1464945313, now seen corresponding path program 929 times [2020-02-10 20:49:38,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:38,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353520549] [2020-02-10 20:49:38,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:38,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353520549] [2020-02-10 20:49:38,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:38,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:38,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632977474] [2020-02-10 20:49:38,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:38,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:38,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:38,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:38,634 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:49:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:38,782 INFO L93 Difference]: Finished difference Result 1194 states and 4213 transitions. [2020-02-10 20:49:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:38,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:38,785 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:49:38,785 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:49:38,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-02-10 20:49:38,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:49:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 20:49:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:49:38,807 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:49:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:38,807 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:49:38,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:49:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:38,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:38,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-02-10 20:49:38,809 INFO L427 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-02-10 20:49:38,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:38,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2002800891, now seen corresponding path program 930 times [2020-02-10 20:49:38,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:38,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972985299] [2020-02-10 20:49:38,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:39,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972985299] [2020-02-10 20:49:39,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:39,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:39,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624697896] [2020-02-10 20:49:39,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:39,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:39,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:39,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:39,175 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:49:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:39,366 INFO L93 Difference]: Finished difference Result 1189 states and 4201 transitions. [2020-02-10 20:49:39,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:39,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:39,370 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:49:39,371 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:49:39,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:49:39,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 773. [2020-02-10 20:49:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:49:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:49:39,395 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:49:39,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:39,395 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:49:39,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:49:39,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:39,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:39,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:39,396 INFO L427 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-02-10 20:49:39,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:39,396 INFO L82 PathProgramCache]: Analyzing trace with hash -426732647, now seen corresponding path program 931 times [2020-02-10 20:49:39,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:39,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154716248] [2020-02-10 20:49:39,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:39,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154716248] [2020-02-10 20:49:39,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:39,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:39,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737437435] [2020-02-10 20:49:39,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:39,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:39,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:39,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:39,770 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:49:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:39,918 INFO L93 Difference]: Finished difference Result 1190 states and 4207 transitions. [2020-02-10 20:49:39,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:39,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:39,921 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:49:39,921 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:49:39,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:49:39,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 778. [2020-02-10 20:49:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:49:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 20:49:39,943 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 20:49:39,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:39,944 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 20:49:39,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 20:49:39,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:39,945 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:39,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:39,945 INFO L427 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-02-10 20:49:39,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1184208311, now seen corresponding path program 932 times [2020-02-10 20:49:39,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:39,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126547426] [2020-02-10 20:49:39,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:40,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126547426] [2020-02-10 20:49:40,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:40,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:40,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921113555] [2020-02-10 20:49:40,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:40,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:40,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:40,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:40,308 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:49:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:40,497 INFO L93 Difference]: Finished difference Result 1194 states and 4212 transitions. [2020-02-10 20:49:40,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:40,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:40,500 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:49:40,500 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:49:40,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-02-10 20:49:40,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:49:40,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-02-10 20:49:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:49:40,523 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:49:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:40,523 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:49:40,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:49:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:40,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:40,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-02-10 20:49:40,524 INFO L427 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-02-10 20:49:40,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:40,524 INFO L82 PathProgramCache]: Analyzing trace with hash -933078913, now seen corresponding path program 933 times [2020-02-10 20:49:40,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:40,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603126326] [2020-02-10 20:49:40,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:40,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:40,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603126326] [2020-02-10 20:49:40,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:40,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:40,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208487030] [2020-02-10 20:49:40,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:40,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:40,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:40,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:40,894 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:49:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:41,047 INFO L93 Difference]: Finished difference Result 1184 states and 4192 transitions. [2020-02-10 20:49:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:41,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:41,051 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:49:41,051 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:49:41,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:49:41,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 20:49:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:49:41,073 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:49:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:41,073 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:49:41,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:49:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:41,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:41,074 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:41,074 INFO L427 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-02-10 20:49:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:41,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1215717623, now seen corresponding path program 934 times [2020-02-10 20:49:41,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:41,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639745782] [2020-02-10 20:49:41,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:41,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639745782] [2020-02-10 20:49:41,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:41,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:41,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439718925] [2020-02-10 20:49:41,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:41,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:41,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:41,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:41,460 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:49:41,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:41,632 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-02-10 20:49:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:41,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:41,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:41,636 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:49:41,636 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:49:41,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:41,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:49:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-02-10 20:49:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:49:41,658 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:49:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:41,659 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:49:41,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:49:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:41,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:41,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:41,660 INFO L427 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-02-10 20:49:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash -922575809, now seen corresponding path program 935 times [2020-02-10 20:49:41,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:41,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162777051] [2020-02-10 20:49:41,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:42,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162777051] [2020-02-10 20:49:42,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:42,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:42,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935488071] [2020-02-10 20:49:42,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:42,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:42,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:42,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:42,022 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:49:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:42,170 INFO L93 Difference]: Finished difference Result 1192 states and 4206 transitions. [2020-02-10 20:49:42,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:42,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:42,174 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:49:42,174 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:49:42,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:42,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:49:42,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 20:49:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:49:42,197 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:49:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:42,197 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:49:42,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:49:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:42,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:42,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-02-10 20:49:42,198 INFO L427 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-02-10 20:49:42,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:42,198 INFO L82 PathProgramCache]: Analyzing trace with hash -384720231, now seen corresponding path program 936 times [2020-02-10 20:49:42,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:42,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656002138] [2020-02-10 20:49:42,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:42,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656002138] [2020-02-10 20:49:42,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:42,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:42,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485065223] [2020-02-10 20:49:42,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:42,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:42,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:42,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:42,563 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:49:42,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:42,763 INFO L93 Difference]: Finished difference Result 1187 states and 4194 transitions. [2020-02-10 20:49:42,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:42,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:42,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:42,767 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:49:42,767 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:49:42,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:42,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:49:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 771. [2020-02-10 20:49:42,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:49:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-02-10 20:49:42,790 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-02-10 20:49:42,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:42,791 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-02-10 20:49:42,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-02-10 20:49:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:42,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:42,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-02-10 20:49:42,792 INFO L427 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-02-10 20:49:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:42,792 INFO L82 PathProgramCache]: Analyzing trace with hash -241103101, now seen corresponding path program 937 times [2020-02-10 20:49:42,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:42,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101656251] [2020-02-10 20:49:42,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:43,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101656251] [2020-02-10 20:49:43,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:43,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:43,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644129550] [2020-02-10 20:49:43,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:43,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:43,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:43,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:43,161 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-02-10 20:49:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:43,305 INFO L93 Difference]: Finished difference Result 1206 states and 4252 transitions. [2020-02-10 20:49:43,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:43,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:43,308 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:49:43,308 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:49:43,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-02-10 20:49:43,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:49:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 779. [2020-02-10 20:49:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:49:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 20:49:43,330 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 20:49:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:43,331 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 20:49:43,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 20:49:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:43,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:43,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-02-10 20:49:43,332 INFO L427 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-02-10 20:49:43,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:43,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1369837857, now seen corresponding path program 938 times [2020-02-10 20:49:43,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:43,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622991614] [2020-02-10 20:49:43,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:43,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:43,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622991614] [2020-02-10 20:49:43,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:43,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:43,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103200815] [2020-02-10 20:49:43,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:43,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:43,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:43,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:43,707 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:49:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:43,875 INFO L93 Difference]: Finished difference Result 1203 states and 4243 transitions. [2020-02-10 20:49:43,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:43,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:43,878 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 20:49:43,878 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:49:43,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:43,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:49:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 776. [2020-02-10 20:49:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:49:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-02-10 20:49:43,901 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-02-10 20:49:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:43,901 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-02-10 20:49:43,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-02-10 20:49:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:43,902 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:43,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-02-10 20:49:43,902 INFO L427 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-02-10 20:49:43,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:43,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1841540955, now seen corresponding path program 939 times [2020-02-10 20:49:43,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:43,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889522576] [2020-02-10 20:49:43,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:44,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889522576] [2020-02-10 20:49:44,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:44,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:44,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240091214] [2020-02-10 20:49:44,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:44,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:44,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:44,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:44,296 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:49:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:44,442 INFO L93 Difference]: Finished difference Result 1213 states and 4266 transitions. [2020-02-10 20:49:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:44,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:44,446 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:49:44,446 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:49:44,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-02-10 20:49:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:49:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 782. [2020-02-10 20:49:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:49:44,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-02-10 20:49:44,468 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-02-10 20:49:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:44,469 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-02-10 20:49:44,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:44,469 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-02-10 20:49:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:44,470 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:44,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-02-10 20:49:44,470 INFO L427 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-02-10 20:49:44,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:44,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1380340961, now seen corresponding path program 940 times [2020-02-10 20:49:44,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:44,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866703018] [2020-02-10 20:49:44,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:44,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866703018] [2020-02-10 20:49:44,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:44,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:44,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575864383] [2020-02-10 20:49:44,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:44,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:44,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:44,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:44,846 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:49:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:45,012 INFO L93 Difference]: Finished difference Result 1214 states and 4262 transitions. [2020-02-10 20:49:45,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:45,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:45,016 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:49:45,016 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:49:45,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-02-10 20:49:45,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:49:45,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 776. [2020-02-10 20:49:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:49:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-02-10 20:49:45,039 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-02-10 20:49:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:45,039 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-02-10 20:49:45,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-02-10 20:49:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:45,041 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:45,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-02-10 20:49:45,041 INFO L427 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-02-10 20:49:45,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:45,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1831037851, now seen corresponding path program 941 times [2020-02-10 20:49:45,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:45,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497567075] [2020-02-10 20:49:45,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:45,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:45,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497567075] [2020-02-10 20:49:45,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:45,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:45,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512635680] [2020-02-10 20:49:45,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:45,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:45,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:45,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:45,418 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:49:45,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:45,555 INFO L93 Difference]: Finished difference Result 1204 states and 4242 transitions. [2020-02-10 20:49:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:45,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:45,558 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:49:45,558 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:49:45,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-02-10 20:49:45,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:49:45,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 779. [2020-02-10 20:49:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:49:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:49:45,581 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:49:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:45,582 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:49:45,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:49:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:45,583 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:45,583 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:45,583 INFO L427 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-02-10 20:49:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash -220096893, now seen corresponding path program 942 times [2020-02-10 20:49:45,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:45,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985561861] [2020-02-10 20:49:45,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:45,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-02-10 20:49:45,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985561861] [2020-02-10 20:49:45,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:45,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:45,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789807012] [2020-02-10 20:49:45,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:45,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:45,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:45,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:45,956 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:49:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:46,120 INFO L93 Difference]: Finished difference Result 1208 states and 4247 transitions. [2020-02-10 20:49:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:46,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:46,124 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:49:46,124 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:49:46,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:46,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:49:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 773. [2020-02-10 20:49:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:49:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:49:46,146 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:49:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:46,147 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:49:46,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:49:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:46,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:46,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-02-10 20:49:46,148 INFO L427 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-02-10 20:49:46,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1242031837, now seen corresponding path program 943 times [2020-02-10 20:49:46,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:46,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197076400] [2020-02-10 20:49:46,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:46,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197076400] [2020-02-10 20:49:46,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:46,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:46,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133218204] [2020-02-10 20:49:46,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:46,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:46,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:46,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:46,521 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:49:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:46,710 INFO L93 Difference]: Finished difference Result 1195 states and 4221 transitions. [2020-02-10 20:49:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:46,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:46,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:46,714 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:49:46,714 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:49:46,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-02-10 20:49:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:49:46,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 778. [2020-02-10 20:49:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:49:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 20:49:46,736 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 20:49:46,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:46,736 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 20:49:46,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:46,737 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 20:49:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:46,738 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:46,738 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:46,738 INFO L427 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-02-10 20:49:46,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:46,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1441994501, now seen corresponding path program 944 times [2020-02-10 20:49:46,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:46,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351992090] [2020-02-10 20:49:46,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:47,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351992090] [2020-02-10 20:49:47,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:47,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:47,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478879070] [2020-02-10 20:49:47,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:47,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:47,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:47,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:47,107 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:49:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:47,267 INFO L93 Difference]: Finished difference Result 1192 states and 4212 transitions. [2020-02-10 20:49:47,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:47,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:47,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:47,271 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:49:47,271 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 20:49:47,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-02-10 20:49:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 20:49:47,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-02-10 20:49:47,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:49:47,293 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:49:47,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:47,293 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:49:47,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:47,293 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:49:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:47,294 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:47,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-02-10 20:49:47,294 INFO L427 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-02-10 20:49:47,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:47,295 INFO L82 PathProgramCache]: Analyzing trace with hash -864752283, now seen corresponding path program 945 times [2020-02-10 20:49:47,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:47,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533951308] [2020-02-10 20:49:47,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:47,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533951308] [2020-02-10 20:49:47,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:47,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:47,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211421416] [2020-02-10 20:49:47,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:47,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:47,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:47,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:47,665 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:49:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:47,812 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-02-10 20:49:47,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:47,813 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:47,816 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:49:47,816 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:49:47,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:49:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 20:49:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:49:47,839 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:49:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:47,839 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:49:47,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:47,839 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:49:47,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:47,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:47,840 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:47,840 INFO L427 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-02-10 20:49:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1399982085, now seen corresponding path program 946 times [2020-02-10 20:49:47,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:47,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583800359] [2020-02-10 20:49:47,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:48,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583800359] [2020-02-10 20:49:48,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:48,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:48,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925006211] [2020-02-10 20:49:48,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:48,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:48,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:48,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:48,203 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:49:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:48,355 INFO L93 Difference]: Finished difference Result 1189 states and 4204 transitions. [2020-02-10 20:49:48,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:48,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:48,359 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:49:48,359 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:49:48,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-02-10 20:49:48,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:49:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-02-10 20:49:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:49:48,382 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:49:48,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:48,382 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:49:48,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:49:48,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:48,383 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:48,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-02-10 20:49:48,383 INFO L427 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-02-10 20:49:48,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:48,384 INFO L82 PathProgramCache]: Analyzing trace with hash -854249179, now seen corresponding path program 947 times [2020-02-10 20:49:48,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:48,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905962930] [2020-02-10 20:49:48,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:48,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905962930] [2020-02-10 20:49:48,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:48,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:48,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700555323] [2020-02-10 20:49:48,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:48,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:48,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:48,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:48,758 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:49:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:48,901 INFO L93 Difference]: Finished difference Result 1187 states and 4200 transitions. [2020-02-10 20:49:48,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:48,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:48,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:48,905 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:49:48,905 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:49:48,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:49:48,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 20:49:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:48,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:49:48,928 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:49:48,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:48,928 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:49:48,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:48,928 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:49:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:48,929 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:48,929 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:48,929 INFO L427 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-02-10 20:49:48,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:48,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1294547357, now seen corresponding path program 948 times [2020-02-10 20:49:48,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:48,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339283586] [2020-02-10 20:49:48,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:49,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:49,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339283586] [2020-02-10 20:49:49,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:49,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:49,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667387908] [2020-02-10 20:49:49,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:49,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:49,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:49,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:49,304 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:49:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:49,449 INFO L93 Difference]: Finished difference Result 1186 states and 4196 transitions. [2020-02-10 20:49:49,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:49,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:49,452 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:49:49,453 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:49:49,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:49:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-02-10 20:49:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:49:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:49:49,475 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:49:49,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:49,476 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:49:49,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:49,476 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:49:49,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:49,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:49,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:49,477 INFO L427 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-02-10 20:49:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:49,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1567628061, now seen corresponding path program 949 times [2020-02-10 20:49:49,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:49,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993108101] [2020-02-10 20:49:49,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:49,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993108101] [2020-02-10 20:49:49,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:49,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:49,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900081426] [2020-02-10 20:49:49,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:49,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:49,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:49,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:49,847 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:49:49,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:49,988 INFO L93 Difference]: Finished difference Result 1209 states and 4253 transitions. [2020-02-10 20:49:49,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:49,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:49,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:49,992 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:49:49,992 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:49:49,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:50,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:49:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-02-10 20:49:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:49:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-02-10 20:49:50,015 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-02-10 20:49:50,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:50,015 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-02-10 20:49:50,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-02-10 20:49:50,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:50,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:50,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-02-10 20:49:50,017 INFO L427 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-02-10 20:49:50,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:50,017 INFO L82 PathProgramCache]: Analyzing trace with hash 494542681, now seen corresponding path program 950 times [2020-02-10 20:49:50,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:50,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351247354] [2020-02-10 20:49:50,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:50,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351247354] [2020-02-10 20:49:50,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:50,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:50,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965416926] [2020-02-10 20:49:50,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:50,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:50,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:50,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:50,403 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:49:50,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:50,547 INFO L93 Difference]: Finished difference Result 1210 states and 4249 transitions. [2020-02-10 20:49:50,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:50,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:50,551 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:49:50,551 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:49:50,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:49:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 775. [2020-02-10 20:49:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:49:50,574 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:49:50,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:50,574 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:49:50,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:50,574 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:49:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:50,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:50,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-02-10 20:49:50,575 INFO L427 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-02-10 20:49:50,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:50,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1061281795, now seen corresponding path program 951 times [2020-02-10 20:49:50,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:50,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802378760] [2020-02-10 20:49:50,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:50,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802378760] [2020-02-10 20:49:50,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:50,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:50,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425831572] [2020-02-10 20:49:50,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:50,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:50,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:50,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:50,943 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:49:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:51,084 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-02-10 20:49:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:51,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:51,087 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:49:51,088 INFO L226 Difference]: Without dead ends: 1185 [2020-02-10 20:49:51,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:51,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-02-10 20:49:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 777. [2020-02-10 20:49:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:49:51,110 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:49:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:51,110 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:49:51,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:49:51,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:51,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:51,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-02-10 20:49:51,112 INFO L427 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-02-10 20:49:51,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:51,112 INFO L82 PathProgramCache]: Analyzing trace with hash 526051993, now seen corresponding path program 952 times [2020-02-10 20:49:51,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:51,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104037821] [2020-02-10 20:49:51,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:51,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104037821] [2020-02-10 20:49:51,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:51,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:51,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869766074] [2020-02-10 20:49:51,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:51,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:51,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:51,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:51,474 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:49:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:51,617 INFO L93 Difference]: Finished difference Result 1196 states and 4219 transitions. [2020-02-10 20:49:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:51,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:51,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:51,620 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:49:51,621 INFO L226 Difference]: Without dead ends: 1183 [2020-02-10 20:49:51,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-02-10 20:49:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-02-10 20:49:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 775. [2020-02-10 20:49:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:49:51,643 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:49:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:51,643 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:49:51,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:49:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:51,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:51,645 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:51,645 INFO L427 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-02-10 20:49:51,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:51,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1082288003, now seen corresponding path program 953 times [2020-02-10 20:49:51,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:51,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063186181] [2020-02-10 20:49:51,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:52,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063186181] [2020-02-10 20:49:52,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:52,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:52,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571032587] [2020-02-10 20:49:52,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:52,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:52,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:52,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:52,016 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:49:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:52,160 INFO L93 Difference]: Finished difference Result 1202 states and 4231 transitions. [2020-02-10 20:49:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:52,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:52,164 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:49:52,164 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:49:52,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:49:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-02-10 20:49:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:49:52,187 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:49:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:52,187 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:49:52,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:49:52,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:52,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:52,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-02-10 20:49:52,189 INFO L427 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-02-10 20:49:52,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1620143581, now seen corresponding path program 954 times [2020-02-10 20:49:52,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:52,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471172894] [2020-02-10 20:49:52,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:52,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-02-10 20:49:52,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471172894] [2020-02-10 20:49:52,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:52,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:52,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415017673] [2020-02-10 20:49:52,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:52,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:52,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:52,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:52,556 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:49:52,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:52,702 INFO L93 Difference]: Finished difference Result 1197 states and 4219 transitions. [2020-02-10 20:49:52,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:52,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:52,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:52,706 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 20:49:52,706 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:49:52,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:49:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-02-10 20:49:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:49:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:49:52,730 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:49:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:52,730 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:49:52,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:49:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:52,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:52,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-02-10 20:49:52,731 INFO L427 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-02-10 20:49:52,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:52,731 INFO L82 PathProgramCache]: Analyzing trace with hash -790802053, now seen corresponding path program 955 times [2020-02-10 20:49:52,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:52,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144767068] [2020-02-10 20:49:52,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:53,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144767068] [2020-02-10 20:49:53,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:53,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:53,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678463299] [2020-02-10 20:49:53,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:53,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:53,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:53,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:53,097 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:49:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:53,233 INFO L93 Difference]: Finished difference Result 1194 states and 4215 transitions. [2020-02-10 20:49:53,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:53,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:53,237 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:49:53,238 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:49:53,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:49:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 778. [2020-02-10 20:49:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:49:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-02-10 20:49:53,273 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-02-10 20:49:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:53,273 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-02-10 20:49:53,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-02-10 20:49:53,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:53,274 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:53,274 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:53,274 INFO L427 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-02-10 20:49:53,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:53,274 INFO L82 PathProgramCache]: Analyzing trace with hash 820138905, now seen corresponding path program 956 times [2020-02-10 20:49:53,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:53,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089895812] [2020-02-10 20:49:53,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:53,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089895812] [2020-02-10 20:49:53,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:53,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:53,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079926235] [2020-02-10 20:49:53,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:53,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:53,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:53,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:53,638 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:49:53,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:53,779 INFO L93 Difference]: Finished difference Result 1198 states and 4220 transitions. [2020-02-10 20:49:53,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:53,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:53,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:53,782 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 20:49:53,783 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:49:53,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-02-10 20:49:53,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:49:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 775. [2020-02-10 20:49:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:49:53,805 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:49:53,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:53,806 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:49:53,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:49:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:53,807 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:53,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-02-10 20:49:53,807 INFO L427 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-02-10 20:49:53,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:53,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1297148319, now seen corresponding path program 957 times [2020-02-10 20:49:53,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:53,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069932615] [2020-02-10 20:49:53,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:54,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069932615] [2020-02-10 20:49:54,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:54,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:54,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321739039] [2020-02-10 20:49:54,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:54,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:54,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:54,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:54,183 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:49:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:54,311 INFO L93 Difference]: Finished difference Result 1188 states and 4200 transitions. [2020-02-10 20:49:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:54,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:54,314 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:49:54,314 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:49:54,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-02-10 20:49:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:49:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 20:49:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:49:54,337 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:49:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:54,337 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:49:54,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:49:54,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:54,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:54,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-02-10 20:49:54,339 INFO L427 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-02-10 20:49:54,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash 851648217, now seen corresponding path program 958 times [2020-02-10 20:49:54,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:54,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438902170] [2020-02-10 20:49:54,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:54,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:54,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438902170] [2020-02-10 20:49:54,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:54,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:54,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925419886] [2020-02-10 20:49:54,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:54,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:54,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:54,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:54,703 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:49:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:54,850 INFO L93 Difference]: Finished difference Result 1187 states and 4196 transitions. [2020-02-10 20:49:54,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:54,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:54,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:54,854 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:49:54,854 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:49:54,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:54,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:49:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-02-10 20:49:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:49:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:49:54,877 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:49:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:54,877 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:49:54,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:49:54,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:54,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:54,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:54,879 INFO L427 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-02-10 20:49:54,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:54,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1286645215, now seen corresponding path program 959 times [2020-02-10 20:49:54,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:54,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037456721] [2020-02-10 20:49:54,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:55,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037456721] [2020-02-10 20:49:55,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:55,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:55,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303871755] [2020-02-10 20:49:55,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:55,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:55,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:55,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:55,254 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:49:55,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:55,386 INFO L93 Difference]: Finished difference Result 1196 states and 4214 transitions. [2020-02-10 20:49:55,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:55,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:55,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:55,390 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:49:55,390 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:49:55,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:49:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-02-10 20:49:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:49:55,413 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:49:55,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:55,413 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:49:55,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:49:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:55,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:55,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-02-10 20:49:55,414 INFO L427 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-02-10 20:49:55,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:55,414 INFO L82 PathProgramCache]: Analyzing trace with hash -748789637, now seen corresponding path program 960 times [2020-02-10 20:49:55,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:55,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530628220] [2020-02-10 20:49:55,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:55,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530628220] [2020-02-10 20:49:55,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:55,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:55,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965792144] [2020-02-10 20:49:55,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:55,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:55,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:55,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:55,782 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:49:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:55,928 INFO L93 Difference]: Finished difference Result 1191 states and 4202 transitions. [2020-02-10 20:49:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:55,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:55,932 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:49:55,932 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:49:55,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:49:55,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 769. [2020-02-10 20:49:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 20:49:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3074 transitions. [2020-02-10 20:49:55,955 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3074 transitions. Word has length 25 [2020-02-10 20:49:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:55,955 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3074 transitions. [2020-02-10 20:49:55,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3074 transitions. [2020-02-10 20:49:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:55,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:55,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-02-10 20:49:55,956 INFO L427 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-02-10 20:49:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:55,957 INFO L82 PathProgramCache]: Analyzing trace with hash 377256515, now seen corresponding path program 961 times [2020-02-10 20:49:55,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:55,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88104494] [2020-02-10 20:49:55,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:56,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88104494] [2020-02-10 20:49:56,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:56,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:56,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233631689] [2020-02-10 20:49:56,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:56,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:56,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:56,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:56,351 INFO L87 Difference]: Start difference. First operand 769 states and 3074 transitions. Second operand 10 states. [2020-02-10 20:49:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:56,485 INFO L93 Difference]: Finished difference Result 1207 states and 4273 transitions. [2020-02-10 20:49:56,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:56,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:56,488 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:49:56,488 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:49:56,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:49:56,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-02-10 20:49:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:49:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3117 transitions. [2020-02-10 20:49:56,511 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3117 transitions. Word has length 25 [2020-02-10 20:49:56,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:56,511 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3117 transitions. [2020-02-10 20:49:56,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3117 transitions. [2020-02-10 20:49:56,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:56,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:56,513 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:56,513 INFO L427 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-02-10 20:49:56,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:56,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1347508129, now seen corresponding path program 962 times [2020-02-10 20:49:56,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:56,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610443658] [2020-02-10 20:49:56,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:56,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610443658] [2020-02-10 20:49:56,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:56,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:56,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573125246] [2020-02-10 20:49:56,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:56,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:56,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:56,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:56,896 INFO L87 Difference]: Start difference. First operand 781 states and 3117 transitions. Second operand 10 states. [2020-02-10 20:49:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:57,052 INFO L93 Difference]: Finished difference Result 1209 states and 4273 transitions. [2020-02-10 20:49:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:57,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:57,055 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:49:57,055 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:49:57,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-02-10 20:49:57,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:49:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 20:49:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3107 transitions. [2020-02-10 20:49:57,077 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3107 transitions. Word has length 25 [2020-02-10 20:49:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:57,078 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3107 transitions. [2020-02-10 20:49:57,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3107 transitions. [2020-02-10 20:49:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:57,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:57,079 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:57,079 INFO L427 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-02-10 20:49:57,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:57,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1991676703, now seen corresponding path program 963 times [2020-02-10 20:49:57,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:57,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864429953] [2020-02-10 20:49:57,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:57,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:57,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864429953] [2020-02-10 20:49:57,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:57,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:57,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30822285] [2020-02-10 20:49:57,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:57,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:57,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:57,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:57,487 INFO L87 Difference]: Start difference. First operand 777 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:49:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:57,629 INFO L93 Difference]: Finished difference Result 1203 states and 4261 transitions. [2020-02-10 20:49:57,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:57,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:57,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:57,633 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 20:49:57,633 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:49:57,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-02-10 20:49:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:49:57,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 780. [2020-02-10 20:49:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:49:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-02-10 20:49:57,655 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-02-10 20:49:57,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:57,656 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-02-10 20:49:57,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-02-10 20:49:57,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:57,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:57,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-02-10 20:49:57,657 INFO L427 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-02-10 20:49:57,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:57,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1010921985, now seen corresponding path program 964 times [2020-02-10 20:49:57,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:57,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486552566] [2020-02-10 20:49:57,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:58,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486552566] [2020-02-10 20:49:58,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:58,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:58,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035848960] [2020-02-10 20:49:58,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:58,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:58,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:58,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:58,042 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:49:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:58,188 INFO L93 Difference]: Finished difference Result 1202 states and 4256 transitions. [2020-02-10 20:49:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:58,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:58,192 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:49:58,192 INFO L226 Difference]: Without dead ends: 1187 [2020-02-10 20:49:58,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:58,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-02-10 20:49:58,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 777. [2020-02-10 20:49:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:49:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3104 transitions. [2020-02-10 20:49:58,215 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3104 transitions. Word has length 25 [2020-02-10 20:49:58,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:58,215 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3104 transitions. [2020-02-10 20:49:58,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3104 transitions. [2020-02-10 20:49:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:58,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:58,216 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:58,216 INFO L427 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-02-10 20:49:58,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:58,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1686133315, now seen corresponding path program 965 times [2020-02-10 20:49:58,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:58,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116650340] [2020-02-10 20:49:58,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:58,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116650340] [2020-02-10 20:49:58,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:58,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:58,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470059867] [2020-02-10 20:49:58,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:58,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:58,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:58,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:58,603 INFO L87 Difference]: Start difference. First operand 777 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:49:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:58,736 INFO L93 Difference]: Finished difference Result 1207 states and 4266 transitions. [2020-02-10 20:49:58,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:58,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:58,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:58,739 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:49:58,739 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:49:58,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-02-10 20:49:58,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:49:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 780. [2020-02-10 20:49:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:49:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3109 transitions. [2020-02-10 20:49:58,762 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3109 transitions. Word has length 25 [2020-02-10 20:49:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:58,762 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3109 transitions. [2020-02-10 20:49:58,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3109 transitions. [2020-02-10 20:49:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:58,763 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:58,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-02-10 20:49:58,763 INFO L427 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-02-10 20:49:58,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:58,763 INFO L82 PathProgramCache]: Analyzing trace with hash -997893023, now seen corresponding path program 966 times [2020-02-10 20:49:58,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:58,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195213488] [2020-02-10 20:49:58,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:59,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:59,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195213488] [2020-02-10 20:49:59,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:59,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:59,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052492117] [2020-02-10 20:49:59,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:59,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:59,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:59,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:59,153 INFO L87 Difference]: Start difference. First operand 780 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:49:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:59,298 INFO L93 Difference]: Finished difference Result 1204 states and 4257 transitions. [2020-02-10 20:49:59,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:59,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:59,301 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:49:59,302 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:49:59,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-02-10 20:49:59,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:49:59,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 774. [2020-02-10 20:49:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:49:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3096 transitions. [2020-02-10 20:49:59,325 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3096 transitions. Word has length 25 [2020-02-10 20:49:59,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:59,325 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3096 transitions. [2020-02-10 20:49:59,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:59,325 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3096 transitions. [2020-02-10 20:49:59,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:59,326 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:59,326 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:49:59,326 INFO L427 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-02-10 20:49:59,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:59,327 INFO L82 PathProgramCache]: Analyzing trace with hash -467714937, now seen corresponding path program 967 times [2020-02-10 20:49:59,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:59,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561460901] [2020-02-10 20:49:59,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:49:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:49:59,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561460901] [2020-02-10 20:49:59,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:49:59,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:49:59,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258474895] [2020-02-10 20:49:59,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:49:59,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:49:59,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:49:59,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:49:59,728 INFO L87 Difference]: Start difference. First operand 774 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:49:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:49:59,862 INFO L93 Difference]: Finished difference Result 1213 states and 4287 transitions. [2020-02-10 20:49:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:49:59,862 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:49:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:49:59,865 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:49:59,865 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:49:59,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:49:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:49:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 782. [2020-02-10 20:49:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:49:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3118 transitions. [2020-02-10 20:49:59,889 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3118 transitions. Word has length 25 [2020-02-10 20:49:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:49:59,889 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3118 transitions. [2020-02-10 20:49:59,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:49:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3118 transitions. [2020-02-10 20:49:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:49:59,890 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:49:59,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-02-10 20:49:59,890 INFO L427 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-02-10 20:49:59,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:49:59,890 INFO L82 PathProgramCache]: Analyzing trace with hash 502536677, now seen corresponding path program 968 times [2020-02-10 20:49:59,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:49:59,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98355558] [2020-02-10 20:49:59,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:49:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:00,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98355558] [2020-02-10 20:50:00,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:00,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:00,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131930569] [2020-02-10 20:50:00,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:00,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:00,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:00,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:00,274 INFO L87 Difference]: Start difference. First operand 782 states and 3118 transitions. Second operand 10 states. [2020-02-10 20:50:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:00,418 INFO L93 Difference]: Finished difference Result 1215 states and 4287 transitions. [2020-02-10 20:50:00,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:00,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:00,421 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:50:00,421 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:50:00,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-02-10 20:50:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:50:00,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 778. [2020-02-10 20:50:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:50:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3107 transitions. [2020-02-10 20:50:00,445 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3107 transitions. Word has length 25 [2020-02-10 20:50:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:00,445 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3107 transitions. [2020-02-10 20:50:00,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3107 transitions. [2020-02-10 20:50:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:00,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:00,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-02-10 20:50:00,447 INFO L427 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-02-10 20:50:00,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:00,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1015420001, now seen corresponding path program 969 times [2020-02-10 20:50:00,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:00,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17026874] [2020-02-10 20:50:00,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:00,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17026874] [2020-02-10 20:50:00,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:00,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:00,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576178277] [2020-02-10 20:50:00,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:00,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:00,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:00,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:00,841 INFO L87 Difference]: Start difference. First operand 778 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:50:00,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:00,982 INFO L93 Difference]: Finished difference Result 1212 states and 4281 transitions. [2020-02-10 20:50:00,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:00,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:00,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:00,985 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:50:00,985 INFO L226 Difference]: Without dead ends: 1199 [2020-02-10 20:50:00,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-02-10 20:50:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 782. [2020-02-10 20:50:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:50:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3114 transitions. [2020-02-10 20:50:01,008 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3114 transitions. Word has length 25 [2020-02-10 20:50:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:01,008 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3114 transitions. [2020-02-10 20:50:01,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3114 transitions. [2020-02-10 20:50:01,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:01,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:01,010 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:01,010 INFO L427 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-02-10 20:50:01,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:01,010 INFO L82 PathProgramCache]: Analyzing trace with hash 2017180927, now seen corresponding path program 970 times [2020-02-10 20:50:01,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:01,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74140543] [2020-02-10 20:50:01,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:01,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74140543] [2020-02-10 20:50:01,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:01,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:01,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896333005] [2020-02-10 20:50:01,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:01,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:01,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:01,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:01,393 INFO L87 Difference]: Start difference. First operand 782 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:50:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:01,535 INFO L93 Difference]: Finished difference Result 1213 states and 4279 transitions. [2020-02-10 20:50:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:01,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:01,539 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:50:01,539 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 20:50:01,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-02-10 20:50:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 20:50:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 778. [2020-02-10 20:50:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:50:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3103 transitions. [2020-02-10 20:50:01,562 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3103 transitions. Word has length 25 [2020-02-10 20:50:01,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:01,562 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3103 transitions. [2020-02-10 20:50:01,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3103 transitions. [2020-02-10 20:50:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:01,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:01,563 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:01,563 INFO L427 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-02-10 20:50:01,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:01,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1492354311, now seen corresponding path program 971 times [2020-02-10 20:50:01,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:01,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989789322] [2020-02-10 20:50:01,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:01,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989789322] [2020-02-10 20:50:01,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:01,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:01,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760239989] [2020-02-10 20:50:01,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:01,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:01,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:01,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:01,958 INFO L87 Difference]: Start difference. First operand 778 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:50:02,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:02,108 INFO L93 Difference]: Finished difference Result 1217 states and 4288 transitions. [2020-02-10 20:50:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:02,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:02,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:02,111 INFO L225 Difference]: With dead ends: 1217 [2020-02-10 20:50:02,111 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:50:02,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-02-10 20:50:02,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:50:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 783. [2020-02-10 20:50:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:50:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-02-10 20:50:02,134 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-02-10 20:50:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:02,134 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-02-10 20:50:02,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-02-10 20:50:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:02,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:02,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-02-10 20:50:02,135 INFO L427 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-02-10 20:50:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:02,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2030209889, now seen corresponding path program 972 times [2020-02-10 20:50:02,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:02,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221995308] [2020-02-10 20:50:02,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:02,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221995308] [2020-02-10 20:50:02,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:02,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:02,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896865377] [2020-02-10 20:50:02,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:02,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:02,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:02,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:02,541 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:50:02,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:02,675 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 20:50:02,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:02,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:02,678 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:50:02,679 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:50:02,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-02-10 20:50:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:50:02,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 774. [2020-02-10 20:50:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:50:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3093 transitions. [2020-02-10 20:50:02,702 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3093 transitions. Word has length 25 [2020-02-10 20:50:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:02,702 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3093 transitions. [2020-02-10 20:50:02,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3093 transitions. [2020-02-10 20:50:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:02,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:02,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-02-10 20:50:02,703 INFO L427 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-02-10 20:50:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:02,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1035833415, now seen corresponding path program 973 times [2020-02-10 20:50:02,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:02,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025373808] [2020-02-10 20:50:02,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:03,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025373808] [2020-02-10 20:50:03,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:03,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:03,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840410694] [2020-02-10 20:50:03,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:03,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:03,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:03,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:03,101 INFO L87 Difference]: Start difference. First operand 774 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:50:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:03,258 INFO L93 Difference]: Finished difference Result 1202 states and 4256 transitions. [2020-02-10 20:50:03,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:03,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:03,261 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:50:03,261 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 20:50:03,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-02-10 20:50:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 20:50:03,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 780. [2020-02-10 20:50:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:50:03,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3109 transitions. [2020-02-10 20:50:03,284 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3109 transitions. Word has length 25 [2020-02-10 20:50:03,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:03,284 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3109 transitions. [2020-02-10 20:50:03,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3109 transitions. [2020-02-10 20:50:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:03,285 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50: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-02-10 20:50:03,285 INFO L427 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-02-10 20:50:03,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2016588133, now seen corresponding path program 974 times [2020-02-10 20:50:03,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:03,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200117639] [2020-02-10 20:50:03,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:03,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-02-10 20:50:03,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200117639] [2020-02-10 20:50:03,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:03,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:03,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56337036] [2020-02-10 20:50:03,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:03,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:03,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:03,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:03,677 INFO L87 Difference]: Start difference. First operand 780 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:50:03,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:03,816 INFO L93 Difference]: Finished difference Result 1201 states and 4251 transitions. [2020-02-10 20:50:03,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:03,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:03,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:03,819 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 20:50:03,819 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:50:03,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:50:03,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-02-10 20:50:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-02-10 20:50:03,842 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-02-10 20:50:03,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:03,842 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-02-10 20:50:03,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-02-10 20:50:03,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:03,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:03,844 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:03,844 INFO L427 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-02-10 20:50:03,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:03,844 INFO L82 PathProgramCache]: Analyzing trace with hash 592934275, now seen corresponding path program 975 times [2020-02-10 20:50:03,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:03,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286052615] [2020-02-10 20:50:03,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:04,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286052615] [2020-02-10 20:50:04,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:04,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:04,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523818197] [2020-02-10 20:50:04,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:04,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:04,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:04,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:04,242 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:50:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:04,392 INFO L93 Difference]: Finished difference Result 1205 states and 4260 transitions. [2020-02-10 20:50:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:04,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:04,396 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:50:04,396 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:50:04,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:04,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:50:04,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 781. [2020-02-10 20:50:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:50:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-02-10 20:50:04,419 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-02-10 20:50:04,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:04,419 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-02-10 20:50:04,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:04,419 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-02-10 20:50:04,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:04,420 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:04,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-02-10 20:50:04,420 INFO L427 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-02-10 20:50:04,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:04,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1594695201, now seen corresponding path program 976 times [2020-02-10 20:50:04,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:04,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535566868] [2020-02-10 20:50:04,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:04,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535566868] [2020-02-10 20:50:04,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:04,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:04,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330781052] [2020-02-10 20:50:04,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:04,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:04,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:04,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:04,811 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:50:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:04,974 INFO L93 Difference]: Finished difference Result 1206 states and 4258 transitions. [2020-02-10 20:50:04,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:04,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:04,978 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:50:04,978 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:50:04,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:04,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:50:04,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 777. [2020-02-10 20:50:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:05,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 20:50:05,000 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 20:50:05,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:05,000 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 20:50:05,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:05,001 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 20:50:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:05,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:05,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-02-10 20:50:05,002 INFO L427 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-02-10 20:50:05,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:05,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1288561529, now seen corresponding path program 977 times [2020-02-10 20:50:05,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:05,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585160778] [2020-02-10 20:50:05,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:05,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585160778] [2020-02-10 20:50:05,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:05,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:05,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911811540] [2020-02-10 20:50:05,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:05,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:05,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:05,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:05,385 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:50:05,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:05,542 INFO L93 Difference]: Finished difference Result 1202 states and 4250 transitions. [2020-02-10 20:50:05,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:05,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:05,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:05,545 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:50:05,545 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:50:05,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:50:05,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 780. [2020-02-10 20:50:05,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:50:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-02-10 20:50:05,568 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-02-10 20:50:05,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:05,568 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-02-10 20:50:05,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-02-10 20:50:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:05,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:05,570 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:05,570 INFO L427 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-02-10 20:50:05,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:05,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1933320387, now seen corresponding path program 978 times [2020-02-10 20:50:05,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:05,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931964278] [2020-02-10 20:50:05,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:05,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931964278] [2020-02-10 20:50:05,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:05,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:05,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959306425] [2020-02-10 20:50:05,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:05,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:05,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:05,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:05,968 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:50:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:06,121 INFO L93 Difference]: Finished difference Result 1204 states and 4251 transitions. [2020-02-10 20:50:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:06,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:06,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:06,125 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:50:06,125 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:50:06,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-02-10 20:50:06,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:50:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 774. [2020-02-10 20:50:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:50:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3090 transitions. [2020-02-10 20:50:06,148 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3090 transitions. Word has length 25 [2020-02-10 20:50:06,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:06,149 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3090 transitions. [2020-02-10 20:50:06,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3090 transitions. [2020-02-10 20:50:06,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:06,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:06,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-02-10 20:50:06,150 INFO L427 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-02-10 20:50:06,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:06,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1989258399, now seen corresponding path program 979 times [2020-02-10 20:50:06,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:06,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078154595] [2020-02-10 20:50:06,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:06,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078154595] [2020-02-10 20:50:06,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:06,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:06,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463767611] [2020-02-10 20:50:06,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:06,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:06,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:06,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:06,538 INFO L87 Difference]: Start difference. First operand 774 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:50:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:06,674 INFO L93 Difference]: Finished difference Result 1209 states and 4268 transitions. [2020-02-10 20:50:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:06,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:06,678 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:50:06,678 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:50:06,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-02-10 20:50:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:50:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 780. [2020-02-10 20:50:06,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:50:06,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3106 transitions. [2020-02-10 20:50:06,701 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3106 transitions. Word has length 25 [2020-02-10 20:50:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:06,701 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3106 transitions. [2020-02-10 20:50:06,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3106 transitions. [2020-02-10 20:50:06,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:06,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:06,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:06,702 INFO L427 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-02-10 20:50:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:06,702 INFO L82 PathProgramCache]: Analyzing trace with hash -378317441, now seen corresponding path program 980 times [2020-02-10 20:50:06,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:06,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273657003] [2020-02-10 20:50:06,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:07,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-02-10 20:50:07,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273657003] [2020-02-10 20:50:07,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:07,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:07,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785206731] [2020-02-10 20:50:07,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:07,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:07,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:07,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:07,086 INFO L87 Difference]: Start difference. First operand 780 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:50:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:07,257 INFO L93 Difference]: Finished difference Result 1206 states and 4259 transitions. [2020-02-10 20:50:07,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:07,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:07,260 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:50:07,260 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:50:07,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-02-10 20:50:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:50:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-02-10 20:50:07,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 20:50:07,283 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 20:50:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:07,283 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 20:50:07,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 20:50:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:07,284 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:07,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-02-10 20:50:07,284 INFO L427 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-02-10 20:50:07,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:07,284 INFO L82 PathProgramCache]: Analyzing trace with hash -895166811, now seen corresponding path program 981 times [2020-02-10 20:50:07,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:07,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773879160] [2020-02-10 20:50:07,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:07,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773879160] [2020-02-10 20:50:07,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:07,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:07,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998913228] [2020-02-10 20:50:07,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:07,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:07,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:07,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:07,672 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:50:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:07,806 INFO L93 Difference]: Finished difference Result 1213 states and 4275 transitions. [2020-02-10 20:50:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:07,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:07,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:07,809 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:50:07,809 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:50:07,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:50:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 782. [2020-02-10 20:50:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:50:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-02-10 20:50:07,832 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-02-10 20:50:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:07,832 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-02-10 20:50:07,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-02-10 20:50:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:07,833 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:07,833 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:07,833 INFO L427 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-02-10 20:50:07,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:07,834 INFO L82 PathProgramCache]: Analyzing trace with hash -357311233, now seen corresponding path program 982 times [2020-02-10 20:50:07,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:07,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472894853] [2020-02-10 20:50:07,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:08,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:08,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472894853] [2020-02-10 20:50:08,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:08,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:08,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560030715] [2020-02-10 20:50:08,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:08,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:08,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:08,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:08,225 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:50:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:08,388 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-02-10 20:50:08,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:08,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:08,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:08,392 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:50:08,392 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:50:08,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:08,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:50:08,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 20:50:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-02-10 20:50:08,414 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-02-10 20:50:08,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:08,415 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-02-10 20:50:08,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-02-10 20:50:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:08,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:08,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-02-10 20:50:08,416 INFO L427 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-02-10 20:50:08,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:08,416 INFO L82 PathProgramCache]: Analyzing trace with hash -884663707, now seen corresponding path program 983 times [2020-02-10 20:50:08,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:08,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317103308] [2020-02-10 20:50:08,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:08,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317103308] [2020-02-10 20:50:08,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:08,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:08,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944363697] [2020-02-10 20:50:08,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:08,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:08,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:08,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:08,801 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:50:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:08,942 INFO L93 Difference]: Finished difference Result 1205 states and 4254 transitions. [2020-02-10 20:50:08,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:08,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:08,946 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:50:08,946 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:50:08,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-02-10 20:50:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:50:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 780. [2020-02-10 20:50:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:50:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-02-10 20:50:08,980 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-02-10 20:50:08,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:08,980 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-02-10 20:50:08,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-02-10 20:50:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:08,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:08,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-02-10 20:50:08,982 INFO L427 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-02-10 20:50:08,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:08,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1957749087, now seen corresponding path program 984 times [2020-02-10 20:50:08,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:08,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251245805] [2020-02-10 20:50:08,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:09,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251245805] [2020-02-10 20:50:09,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:09,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:09,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441327216] [2020-02-10 20:50:09,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:09,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:09,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:09,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:09,359 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:50:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:09,538 INFO L93 Difference]: Finished difference Result 1207 states and 4255 transitions. [2020-02-10 20:50:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:09,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:09,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:09,541 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:50:09,541 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:50:09,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:50:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 771. [2020-02-10 20:50:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:50:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3083 transitions. [2020-02-10 20:50:09,564 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3083 transitions. Word has length 25 [2020-02-10 20:50:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:09,564 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3083 transitions. [2020-02-10 20:50:09,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3083 transitions. [2020-02-10 20:50:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:09,565 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:09,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:09,565 INFO L427 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-02-10 20:50:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash -47054721, now seen corresponding path program 985 times [2020-02-10 20:50:09,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:09,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238984806] [2020-02-10 20:50:09,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:09,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238984806] [2020-02-10 20:50:09,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:09,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:09,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558101889] [2020-02-10 20:50:09,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:09,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:09,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:09,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:09,940 INFO L87 Difference]: Start difference. First operand 771 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:50:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:10,070 INFO L93 Difference]: Finished difference Result 1193 states and 4226 transitions. [2020-02-10 20:50:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:10,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:10,074 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:50:10,074 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:50:10,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:50:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 780. [2020-02-10 20:50:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:50:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3110 transitions. [2020-02-10 20:50:10,097 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3110 transitions. Word has length 25 [2020-02-10 20:50:10,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:10,097 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3110 transitions. [2020-02-10 20:50:10,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3110 transitions. [2020-02-10 20:50:10,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:10,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:10,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-02-10 20:50:10,098 INFO L427 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-02-10 20:50:10,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:10,098 INFO L82 PathProgramCache]: Analyzing trace with hash 923196893, now seen corresponding path program 986 times [2020-02-10 20:50:10,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:10,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103303920] [2020-02-10 20:50:10,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:10,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103303920] [2020-02-10 20:50:10,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:10,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:10,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019197786] [2020-02-10 20:50:10,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:10,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:10,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:10,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:10,473 INFO L87 Difference]: Start difference. First operand 780 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:50:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:10,629 INFO L93 Difference]: Finished difference Result 1195 states and 4226 transitions. [2020-02-10 20:50:10,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:10,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:10,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:10,633 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:50:10,633 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:50:10,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-02-10 20:50:10,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:50:10,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 776. [2020-02-10 20:50:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:50:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3100 transitions. [2020-02-10 20:50:10,656 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3100 transitions. Word has length 25 [2020-02-10 20:50:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:10,656 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3100 transitions. [2020-02-10 20:50:10,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3100 transitions. [2020-02-10 20:50:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:10,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:10,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-02-10 20:50:10,657 INFO L427 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-02-10 20:50:10,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:10,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1878979357, now seen corresponding path program 987 times [2020-02-10 20:50:10,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:10,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819256449] [2020-02-10 20:50:10,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:11,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819256449] [2020-02-10 20:50:11,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:11,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:11,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104081647] [2020-02-10 20:50:11,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:11,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:11,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:11,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:11,048 INFO L87 Difference]: Start difference. First operand 776 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:50:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:11,211 INFO L93 Difference]: Finished difference Result 1189 states and 4214 transitions. [2020-02-10 20:50:11,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:11,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:11,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:11,215 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:50:11,215 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:50:11,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:50:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 779. [2020-02-10 20:50:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:50:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-02-10 20:50:11,240 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-02-10 20:50:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:11,240 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-02-10 20:50:11,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-02-10 20:50:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:11,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:11,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-02-10 20:50:11,242 INFO L427 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-02-10 20:50:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:11,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1435233221, now seen corresponding path program 988 times [2020-02-10 20:50:11,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:11,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967628868] [2020-02-10 20:50:11,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:11,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967628868] [2020-02-10 20:50:11,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:11,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:11,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086305422] [2020-02-10 20:50:11,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:11,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:11,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:11,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:11,627 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:50:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:11,807 INFO L93 Difference]: Finished difference Result 1188 states and 4209 transitions. [2020-02-10 20:50:11,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:11,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:11,810 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:50:11,810 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:50:11,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:11,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:50:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 776. [2020-02-10 20:50:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:50:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3097 transitions. [2020-02-10 20:50:11,834 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3097 transitions. Word has length 25 [2020-02-10 20:50:11,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:11,834 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3097 transitions. [2020-02-10 20:50:11,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3097 transitions. [2020-02-10 20:50:11,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:11,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:11,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:11,835 INFO L427 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-02-10 20:50:11,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:11,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1261822079, now seen corresponding path program 989 times [2020-02-10 20:50:11,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:11,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680252807] [2020-02-10 20:50:11,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:12,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680252807] [2020-02-10 20:50:12,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:12,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:12,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917518172] [2020-02-10 20:50:12,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:12,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:12,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:12,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:12,219 INFO L87 Difference]: Start difference. First operand 776 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:50:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:12,398 INFO L93 Difference]: Finished difference Result 1193 states and 4219 transitions. [2020-02-10 20:50:12,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:12,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:12,402 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:50:12,402 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:50:12,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-02-10 20:50:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:50:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 779. [2020-02-10 20:50:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:50:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 20:50:12,425 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 20:50:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:12,426 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 20:50:12,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:12,426 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 20:50:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:12,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:12,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-02-10 20:50:12,427 INFO L427 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-02-10 20:50:12,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:12,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1422204259, now seen corresponding path program 990 times [2020-02-10 20:50:12,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:12,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267278233] [2020-02-10 20:50:12,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:12,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267278233] [2020-02-10 20:50:12,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:12,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:12,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834005541] [2020-02-10 20:50:12,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:12,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:12,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:12,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:12,815 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:50:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:12,990 INFO L93 Difference]: Finished difference Result 1190 states and 4210 transitions. [2020-02-10 20:50:12,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:12,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:12,994 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:50:12,994 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:50:12,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:50:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-02-10 20:50:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:50:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-02-10 20:50:13,018 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-02-10 20:50:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:13,018 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-02-10 20:50:13,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-02-10 20:50:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:13,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:13,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-02-10 20:50:13,019 INFO L427 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-02-10 20:50:13,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:13,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1736997625, now seen corresponding path program 991 times [2020-02-10 20:50:13,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:13,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065271097] [2020-02-10 20:50:13,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50: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-02-10 20:50:13,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065271097] [2020-02-10 20:50:13,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:13,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:13,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565756892] [2020-02-10 20:50:13,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:13,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:13,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:13,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:13,389 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:50:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:13,539 INFO L93 Difference]: Finished difference Result 1189 states and 4212 transitions. [2020-02-10 20:50:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:13,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:13,542 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:50:13,542 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:50:13,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:50:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 779. [2020-02-10 20:50:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:50:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 20:50:13,566 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 20:50:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:13,566 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 20:50:13,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 20:50:13,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:13,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:13,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-02-10 20:50:13,568 INFO L427 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-02-10 20:50:13,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:13,568 INFO L82 PathProgramCache]: Analyzing trace with hash -766746011, now seen corresponding path program 992 times [2020-02-10 20:50:13,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:13,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980917565] [2020-02-10 20:50:13,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:13,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980917565] [2020-02-10 20:50:13,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:13,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:13,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428072289] [2020-02-10 20:50:13,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:13,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:13,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:13,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:13,946 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:50:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:14,102 INFO L93 Difference]: Finished difference Result 1191 states and 4212 transitions. [2020-02-10 20:50:14,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:14,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:14,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:14,106 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:50:14,106 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:50:14,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:50:14,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 775. [2020-02-10 20:50:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-02-10 20:50:14,129 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-02-10 20:50:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:14,129 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-02-10 20:50:14,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-02-10 20:50:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:14,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:14,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:14,131 INFO L427 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-02-10 20:50:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:14,131 INFO L82 PathProgramCache]: Analyzing trace with hash -696761827, now seen corresponding path program 993 times [2020-02-10 20:50:14,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:14,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846627294] [2020-02-10 20:50:14,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:14,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846627294] [2020-02-10 20:50:14,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:14,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:14,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975055269] [2020-02-10 20:50:14,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:14,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:14,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:14,497 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:50:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:14,660 INFO L93 Difference]: Finished difference Result 1183 states and 4196 transitions. [2020-02-10 20:50:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:14,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:14,664 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:50:14,664 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:50:14,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:14,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:50:14,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:50:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 20:50:14,687 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 20:50:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:14,687 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 20:50:14,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 20:50:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:14,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:14,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-02-10 20:50:14,688 INFO L427 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-02-10 20:50:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 326005307, now seen corresponding path program 994 times [2020-02-10 20:50:14,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:14,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278356910] [2020-02-10 20:50:14,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:15,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-02-10 20:50:15,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278356910] [2020-02-10 20:50:15,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:15,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:15,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146288644] [2020-02-10 20:50:15,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:15,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:15,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:15,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:15,066 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:50:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:15,227 INFO L93 Difference]: Finished difference Result 1181 states and 4190 transitions. [2020-02-10 20:50:15,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:15,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:15,231 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:50:15,231 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:50:15,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-02-10 20:50:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:50:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 20:50:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:50:15,254 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:50:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:15,254 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:50:15,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:50:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:15,256 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:15,256 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:15,256 INFO L427 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-02-10 20:50:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash 874264071, now seen corresponding path program 995 times [2020-02-10 20:50:15,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:15,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506307730] [2020-02-10 20:50:15,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:15,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506307730] [2020-02-10 20:50:15,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:15,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:15,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384088555] [2020-02-10 20:50:15,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:15,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:15,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:15,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:15,637 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:50:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:15,784 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-02-10 20:50:15,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:15,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:15,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:15,787 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:50:15,787 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:50:15,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:50:15,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 20:50:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:50:15,811 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:50:15,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:15,811 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:50:15,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:15,811 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:50:15,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:15,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:15,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-02-10 20:50:15,812 INFO L427 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-02-10 20:50:15,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:15,812 INFO L82 PathProgramCache]: Analyzing trace with hash 339034269, now seen corresponding path program 996 times [2020-02-10 20:50:15,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:15,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111117292] [2020-02-10 20:50:15,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:16,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111117292] [2020-02-10 20:50:16,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:16,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:16,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684486125] [2020-02-10 20:50:16,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:16,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:16,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:16,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:16,180 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:50:16,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:16,326 INFO L93 Difference]: Finished difference Result 1183 states and 4192 transitions. [2020-02-10 20:50:16,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:16,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:16,330 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:50:16,330 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:50:16,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-02-10 20:50:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:50:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 773. [2020-02-10 20:50:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:50:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 20:50:16,353 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 20:50:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:16,353 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 20:50:16,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 20:50:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:16,355 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:16,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-02-10 20:50:16,355 INFO L427 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-02-10 20:50:16,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:16,355 INFO L82 PathProgramCache]: Analyzing trace with hash -233449273, now seen corresponding path program 997 times [2020-02-10 20:50:16,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:16,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905422714] [2020-02-10 20:50:16,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:16,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905422714] [2020-02-10 20:50:16,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:16,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:16,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711887005] [2020-02-10 20:50:16,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:16,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:16,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:16,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:16,749 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:50:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:16,917 INFO L93 Difference]: Finished difference Result 1181 states and 4192 transitions. [2020-02-10 20:50:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:16,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:16,920 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:50:16,921 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:50:16,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:50:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 778. [2020-02-10 20:50:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:50:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-02-10 20:50:16,943 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-02-10 20:50:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:16,943 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-02-10 20:50:16,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-02-10 20:50:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:16,945 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:16,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:16,945 INFO L427 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-02-10 20:50:16,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash 747305445, now seen corresponding path program 998 times [2020-02-10 20:50:16,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:16,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711798992] [2020-02-10 20:50:16,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:17,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711798992] [2020-02-10 20:50:17,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:17,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:17,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770077685] [2020-02-10 20:50:17,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:17,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:17,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:17,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:17,342 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:50:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:17,478 INFO L93 Difference]: Finished difference Result 1180 states and 4187 transitions. [2020-02-10 20:50:17,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:17,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:17,481 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:50:17,481 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:50:17,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:17,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:50:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 775. [2020-02-10 20:50:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:50:17,503 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:50:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:17,503 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:50:17,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:50:17,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:17,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:17,505 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:17,505 INFO L427 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-02-10 20:50:17,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:17,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1119247553, now seen corresponding path program 999 times [2020-02-10 20:50:17,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:17,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534705951] [2020-02-10 20:50:17,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:17,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534705951] [2020-02-10 20:50:17,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:17,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:17,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726862306] [2020-02-10 20:50:17,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:17,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:17,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:17,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:17,886 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:50:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:18,040 INFO L93 Difference]: Finished difference Result 1179 states and 4185 transitions. [2020-02-10 20:50:18,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:18,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:18,043 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:50:18,043 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:50:18,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:50:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 777. [2020-02-10 20:50:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:50:18,066 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:50:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:18,066 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:50:18,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:50:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:18,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:18,067 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:18,067 INFO L427 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-02-10 20:50:18,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash -96480419, now seen corresponding path program 1000 times [2020-02-10 20:50:18,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:18,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502397552] [2020-02-10 20:50:18,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:18,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502397552] [2020-02-10 20:50:18,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:18,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:18,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32642398] [2020-02-10 20:50:18,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:18,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:18,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:18,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:18,448 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:50:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:18,593 INFO L93 Difference]: Finished difference Result 1177 states and 4179 transitions. [2020-02-10 20:50:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:18,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:18,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:18,597 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 20:50:18,597 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 20:50:18,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 20:50:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-02-10 20:50:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:50:18,620 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:50:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:18,620 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:50:18,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:50:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:18,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:18,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-02-10 20:50:18,621 INFO L427 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-02-10 20:50:18,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:18,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1906651769, now seen corresponding path program 1001 times [2020-02-10 20:50:18,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:18,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393843558] [2020-02-10 20:50:18,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:19,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393843558] [2020-02-10 20:50:19,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:19,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:19,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925903554] [2020-02-10 20:50:19,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:19,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:19,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:19,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:19,030 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:50:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:19,174 INFO L93 Difference]: Finished difference Result 1177 states and 4179 transitions. [2020-02-10 20:50:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:19,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:19,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:19,178 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 20:50:19,178 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:50:19,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:50:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-02-10 20:50:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:50:19,200 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:50:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:19,201 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:50:19,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:50:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:19,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:19,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-02-10 20:50:19,202 INFO L427 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-02-10 20:50:19,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:19,202 INFO L82 PathProgramCache]: Analyzing trace with hash 242144767, now seen corresponding path program 1002 times [2020-02-10 20:50:19,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:19,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919242403] [2020-02-10 20:50:19,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:19,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919242403] [2020-02-10 20:50:19,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:19,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:19,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94646819] [2020-02-10 20:50:19,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:19,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:19,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:19,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:19,590 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:50:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:19,768 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-02-10 20:50:19,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:19,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:19,771 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 20:50:19,771 INFO L226 Difference]: Without dead ends: 1161 [2020-02-10 20:50:19,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-02-10 20:50:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-02-10 20:50:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 773. [2020-02-10 20:50:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:50:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:50:19,794 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:50:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:19,794 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:50:19,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:50:19,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:19,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:19,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-02-10 20:50:19,795 INFO L427 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-02-10 20:50:19,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:19,795 INFO L82 PathProgramCache]: Analyzing trace with hash 593527069, now seen corresponding path program 1003 times [2020-02-10 20:50:19,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:19,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927331153] [2020-02-10 20:50:19,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:20,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927331153] [2020-02-10 20:50:20,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:20,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:20,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98727576] [2020-02-10 20:50:20,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:20,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:20,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:20,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:20,175 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:50:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:20,342 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-02-10 20:50:20,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:20,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:20,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:20,346 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:50:20,346 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:50:20,346 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:20,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:50:20,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-02-10 20:50:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:50:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 20:50:20,369 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 20:50:20,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:20,369 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 20:50:20,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 20:50:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:20,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:20,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-02-10 20:50:20,371 INFO L427 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-02-10 20:50:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:20,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2090499269, now seen corresponding path program 1004 times [2020-02-10 20:50:20,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:20,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016679285] [2020-02-10 20:50:20,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:20,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016679285] [2020-02-10 20:50:20,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:20,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:20,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089072898] [2020-02-10 20:50:20,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:20,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:20,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:20,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:20,755 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:50:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:20,910 INFO L93 Difference]: Finished difference Result 1184 states and 4193 transitions. [2020-02-10 20:50:20,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:20,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:20,914 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:50:20,914 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:50:20,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:50:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-02-10 20:50:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:50:20,938 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:50:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:20,938 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:50:20,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:50:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:20,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:20,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-02-10 20:50:20,939 INFO L427 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-02-10 20:50:20,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:20,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1513257051, now seen corresponding path program 1005 times [2020-02-10 20:50:20,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:20,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427885980] [2020-02-10 20:50:20,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:21,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427885980] [2020-02-10 20:50:21,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:21,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:21,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062477705] [2020-02-10 20:50:21,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:21,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:21,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:21,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:21,318 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:50:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:21,472 INFO L93 Difference]: Finished difference Result 1185 states and 4195 transitions. [2020-02-10 20:50:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:21,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:21,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:21,475 INFO L225 Difference]: With dead ends: 1185 [2020-02-10 20:50:21,475 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:50:21,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:50:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:50:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:50:21,498 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:50:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:21,498 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:50:21,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:50:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:21,499 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:21,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:21,500 INFO L427 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-02-10 20:50:21,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash -2048486853, now seen corresponding path program 1006 times [2020-02-10 20:50:21,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:21,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820444416] [2020-02-10 20:50:21,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:21,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820444416] [2020-02-10 20:50:21,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:21,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:21,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538505800] [2020-02-10 20:50:21,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:21,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:21,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:21,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:21,890 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:50:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:22,055 INFO L93 Difference]: Finished difference Result 1181 states and 4185 transitions. [2020-02-10 20:50:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:22,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:22,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:22,059 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:50:22,059 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:50:22,059 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:50:22,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 20:50:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:50:22,082 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:50:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:22,083 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:50:22,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:50:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:22,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:22,084 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:22,084 INFO L427 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-02-10 20:50:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1502753947, now seen corresponding path program 1007 times [2020-02-10 20:50:22,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:22,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651568843] [2020-02-10 20:50:22,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:22,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651568843] [2020-02-10 20:50:22,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:22,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:22,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090555536] [2020-02-10 20:50:22,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:22,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:22,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:22,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:22,482 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:50:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:22,639 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-02-10 20:50:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:22,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:22,643 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:50:22,643 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:50: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-02-10 20:50:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:50:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 777. [2020-02-10 20:50:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:50:22,666 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:50:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:22,666 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:50:22,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:50:22,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:22,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:22,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-02-10 20:50:22,668 INFO L427 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-02-10 20:50:22,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:22,668 INFO L82 PathProgramCache]: Analyzing trace with hash 646042589, now seen corresponding path program 1008 times [2020-02-10 20:50:22,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:22,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930472567] [2020-02-10 20:50:22,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:23,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930472567] [2020-02-10 20:50:23,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:23,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:23,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022856163] [2020-02-10 20:50:23,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:23,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:23,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:23,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:23,054 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:50:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:23,222 INFO L93 Difference]: Finished difference Result 1178 states and 4177 transitions. [2020-02-10 20:50:23,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:23,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:23,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:23,226 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 20:50:23,226 INFO L226 Difference]: Without dead ends: 1161 [2020-02-10 20:50:23,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:23,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-02-10 20:50:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 771. [2020-02-10 20:50:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:50:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-02-10 20:50:23,248 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-02-10 20:50:23,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:23,248 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-02-10 20:50:23,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-02-10 20:50:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:23,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:23,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-02-10 20:50:23,249 INFO L427 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-02-10 20:50:23,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:23,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1316337409, now seen corresponding path program 1009 times [2020-02-10 20:50:23,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:23,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665429143] [2020-02-10 20:50:23,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50: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-02-10 20:50:23,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665429143] [2020-02-10 20:50:23,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:23,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:23,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529563229] [2020-02-10 20:50:23,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:23,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:23,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:23,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:23,630 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-02-10 20:50:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:23,771 INFO L93 Difference]: Finished difference Result 1205 states and 4258 transitions. [2020-02-10 20:50:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:23,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:23,775 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:50:23,775 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:50:23,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-02-10 20:50:23,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:50:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 781. [2020-02-10 20:50:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:50:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3112 transitions. [2020-02-10 20:50:23,797 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3112 transitions. Word has length 25 [2020-02-10 20:50:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:23,798 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3112 transitions. [2020-02-10 20:50:23,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3112 transitions. [2020-02-10 20:50:23,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:23,799 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:23,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-02-10 20:50:23,799 INFO L427 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-02-10 20:50:23,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:23,799 INFO L82 PathProgramCache]: Analyzing trace with hash -346085795, now seen corresponding path program 1010 times [2020-02-10 20:50:23,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:23,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110267038] [2020-02-10 20:50:23,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:24,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110267038] [2020-02-10 20:50:24,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:24,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:24,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601567577] [2020-02-10 20:50:24,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:24,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:24,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:24,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:24,184 INFO L87 Difference]: Start difference. First operand 781 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:50:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:24,339 INFO L93 Difference]: Finished difference Result 1207 states and 4258 transitions. [2020-02-10 20:50:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:24,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:24,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:24,342 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:50:24,342 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:50:24,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-02-10 20:50:24,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:50:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 777. [2020-02-10 20:50:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-02-10 20:50:24,364 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-02-10 20:50:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:24,365 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-02-10 20:50:24,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-02-10 20:50:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:24,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:24,366 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:24,366 INFO L427 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-02-10 20:50:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash 166797529, now seen corresponding path program 1011 times [2020-02-10 20:50:24,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:24,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935710670] [2020-02-10 20:50:24,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:24,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935710670] [2020-02-10 20:50:24,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:24,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:24,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088226708] [2020-02-10 20:50:24,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:24,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:24,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:24,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:24,752 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:50:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:24,893 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-02-10 20:50:24,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:24,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:24,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:24,897 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:50:24,897 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:50:24,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-02-10 20:50:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:50:24,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 781. [2020-02-10 20:50:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:50:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-02-10 20:50:24,920 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-02-10 20:50:24,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:24,920 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-02-10 20:50:24,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-02-10 20:50:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:24,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:24,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-02-10 20:50:24,921 INFO L427 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-02-10 20:50:24,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:24,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1168558455, now seen corresponding path program 1012 times [2020-02-10 20:50:24,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:24,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686073633] [2020-02-10 20:50:24,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:25,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686073633] [2020-02-10 20:50:25,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:25,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:25,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276348960] [2020-02-10 20:50:25,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:25,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:25,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:25,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:25,309 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:50:25,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:25,481 INFO L93 Difference]: Finished difference Result 1205 states and 4250 transitions. [2020-02-10 20:50:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:25,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:25,485 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:50:25,485 INFO L226 Difference]: Without dead ends: 1187 [2020-02-10 20:50:25,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-02-10 20:50:25,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 777. [2020-02-10 20:50:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 20:50:25,508 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 20:50:25,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:25,508 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 20:50:25,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 20:50:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:25,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:25,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-02-10 20:50:25,509 INFO L427 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-02-10 20:50:25,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:25,510 INFO L82 PathProgramCache]: Analyzing trace with hash 643731839, now seen corresponding path program 1013 times [2020-02-10 20:50:25,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:25,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289063076] [2020-02-10 20:50:25,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:25,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-02-10 20:50:25,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289063076] [2020-02-10 20:50:25,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:25,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:25,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727943173] [2020-02-10 20:50:25,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:25,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:25,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:25,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:25,905 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:50:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:26,054 INFO L93 Difference]: Finished difference Result 1209 states and 4259 transitions. [2020-02-10 20:50:26,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:26,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:26,058 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:50:26,058 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:50:26,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:50:26,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 782. [2020-02-10 20:50:26,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:50:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3106 transitions. [2020-02-10 20:50:26,081 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3106 transitions. Word has length 25 [2020-02-10 20:50:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:26,081 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3106 transitions. [2020-02-10 20:50:26,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3106 transitions. [2020-02-10 20:50:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:26,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:26,082 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:26,082 INFO L427 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-02-10 20:50:26,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:26,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1181587417, now seen corresponding path program 1014 times [2020-02-10 20:50:26,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:26,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364747383] [2020-02-10 20:50:26,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:26,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364747383] [2020-02-10 20:50:26,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:26,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:26,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586684770] [2020-02-10 20:50:26,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:26,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:26,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:26,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:26,469 INFO L87 Difference]: Start difference. First operand 782 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:50:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:26,612 INFO L93 Difference]: Finished difference Result 1208 states and 4252 transitions. [2020-02-10 20:50:26,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:26,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:26,615 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:50:26,615 INFO L226 Difference]: Without dead ends: 1185 [2020-02-10 20:50:26,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-02-10 20:50:26,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 773. [2020-02-10 20:50:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:50:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 20:50:26,638 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 20:50:26,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:26,638 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 20:50:26,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 20:50:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:26,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:26,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-02-10 20:50:26,640 INFO L427 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-02-10 20:50:26,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:26,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2133658435, now seen corresponding path program 1015 times [2020-02-10 20:50:26,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:26,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98966352] [2020-02-10 20:50:26,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:27,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-02-10 20:50:27,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98966352] [2020-02-10 20:50:27,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:27,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:27,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17284597] [2020-02-10 20:50:27,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:27,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:27,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:27,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:27,012 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:50:27,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:27,183 INFO L93 Difference]: Finished difference Result 1195 states and 4227 transitions. [2020-02-10 20:50:27,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:27,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:27,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:27,187 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:50:27,187 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:50:27,187 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:50:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 20:50:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:50:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 20:50:27,210 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 20:50:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:27,210 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 20:50:27,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 20:50:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:27,211 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:27,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-02-10 20:50:27,211 INFO L427 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-02-10 20:50:27,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:27,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1191057247, now seen corresponding path program 1016 times [2020-02-10 20:50:27,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:27,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993421841] [2020-02-10 20:50:27,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:27,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993421841] [2020-02-10 20:50:27,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:27,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:27,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63204252] [2020-02-10 20:50:27,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:27,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:27,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:27,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:27,584 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:50:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:27,741 INFO L93 Difference]: Finished difference Result 1197 states and 4227 transitions. [2020-02-10 20:50:27,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:27,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:27,745 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 20:50:27,745 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:50:27,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-02-10 20:50:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:50:27,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 20:50:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:50:27,767 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:50:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:27,767 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:50:27,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:50:27,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:27,769 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:27,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-02-10 20:50:27,769 INFO L427 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-02-10 20:50:27,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:27,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1121073063, now seen corresponding path program 1017 times [2020-02-10 20:50:27,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:27,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549512890] [2020-02-10 20:50:27,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:28,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549512890] [2020-02-10 20:50:28,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:28,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:28,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573328963] [2020-02-10 20:50:28,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:28,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:28,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:28,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:28,143 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:50:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:28,288 INFO L93 Difference]: Finished difference Result 1189 states and 4211 transitions. [2020-02-10 20:50:28,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:28,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:28,291 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:50:28,291 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:50:28,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-02-10 20:50:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:50:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 20:50:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:50:28,315 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:50:28,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:28,315 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:50:28,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:28,315 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:50:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:28,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:28,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:28,316 INFO L427 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-02-10 20:50:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:28,316 INFO L82 PathProgramCache]: Analyzing trace with hash -98305929, now seen corresponding path program 1018 times [2020-02-10 20:50:28,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:28,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801531306] [2020-02-10 20:50:28,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:28,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801531306] [2020-02-10 20:50:28,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:28,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:28,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358064584] [2020-02-10 20:50:28,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:28,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:28,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:28,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:28,690 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:50:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:28,871 INFO L93 Difference]: Finished difference Result 1187 states and 4205 transitions. [2020-02-10 20:50:28,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:28,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:28,875 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:50:28,875 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:50:28,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:50:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-02-10 20:50:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:50:28,899 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:50:28,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:28,899 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:50:28,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:50:28,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:28,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:28,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-02-10 20:50:28,900 INFO L427 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-02-10 20:50:28,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:28,900 INFO L82 PathProgramCache]: Analyzing trace with hash 449952835, now seen corresponding path program 1019 times [2020-02-10 20:50:28,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:28,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450961252] [2020-02-10 20:50:28,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:29,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450961252] [2020-02-10 20:50:29,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:29,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:29,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470026381] [2020-02-10 20:50:29,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:29,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:29,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:29,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:29,283 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:50:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:29,432 INFO L93 Difference]: Finished difference Result 1193 states and 4217 transitions. [2020-02-10 20:50:29,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:29,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:29,435 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:50:29,436 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:50:29,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-02-10 20:50:29,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:50:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 20:50:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:50:29,458 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:50:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:29,458 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:50:29,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:50:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:29,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:29,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-02-10 20:50:29,460 INFO L427 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-02-10 20:50:29,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:29,460 INFO L82 PathProgramCache]: Analyzing trace with hash -85276967, now seen corresponding path program 1020 times [2020-02-10 20:50:29,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:29,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658387493] [2020-02-10 20:50:29,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:29,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658387493] [2020-02-10 20:50:29,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:29,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:29,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750304017] [2020-02-10 20:50:29,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:29,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:29,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:29,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:29,830 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:50:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:30,022 INFO L93 Difference]: Finished difference Result 1189 states and 4207 transitions. [2020-02-10 20:50:30,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:30,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:30,026 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:50:30,026 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:50:30,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-02-10 20:50:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:50:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 773. [2020-02-10 20:50:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:50:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:50:30,049 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:50:30,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:30,049 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:50:30,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:50:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:30,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:30,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-02-10 20:50:30,050 INFO L427 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-02-10 20:50:30,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:30,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1945631101, now seen corresponding path program 1021 times [2020-02-10 20:50:30,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:30,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863251148] [2020-02-10 20:50:30,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:30,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863251148] [2020-02-10 20:50:30,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:30,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:30,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392662052] [2020-02-10 20:50:30,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:30,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:30,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:30,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:30,439 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:50:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:30,598 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-02-10 20:50:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:30,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:30,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:30,601 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:50:30,601 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:50:30,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-02-10 20:50:30,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:50:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 779. [2020-02-10 20:50:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:50:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 20:50:30,623 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 20:50:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:30,624 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 20:50:30,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 20:50:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:30,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:30,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-02-10 20:50:30,625 INFO L427 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-02-10 20:50:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:30,625 INFO L82 PathProgramCache]: Analyzing trace with hash -943870175, now seen corresponding path program 1022 times [2020-02-10 20:50:30,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:30,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234804331] [2020-02-10 20:50:30,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:31,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-02-10 20:50:31,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234804331] [2020-02-10 20:50:31,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:31,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:31,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360348812] [2020-02-10 20:50:31,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:31,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:31,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:31,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:31,012 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:50:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:31,204 INFO L93 Difference]: Finished difference Result 1194 states and 4219 transitions. [2020-02-10 20:50:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:31,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:31,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:31,208 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:50:31,208 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:50:31,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:50:31,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-02-10 20:50:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:50:31,231 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:50:31,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:31,231 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:50:31,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:50:31,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:31,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:31,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-02-10 20:50:31,233 INFO L427 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-02-10 20:50:31,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:31,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1906437055, now seen corresponding path program 1023 times [2020-02-10 20:50:31,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:31,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097509956] [2020-02-10 20:50:31,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:31,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097509956] [2020-02-10 20:50:31,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:31,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:31,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732864935] [2020-02-10 20:50:31,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:31,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:31,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:31,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:31,616 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:50:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:31,772 INFO L93 Difference]: Finished difference Result 1188 states and 4207 transitions. [2020-02-10 20:50:31,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:31,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:31,775 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:50:31,775 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:50:31,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:50:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 20:50:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:50:31,798 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:50:31,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:31,798 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:50:31,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:50:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:31,799 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:31,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-02-10 20:50:31,799 INFO L427 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-02-10 20:50:31,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:31,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1365763107, now seen corresponding path program 1024 times [2020-02-10 20:50:31,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:31,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209596092] [2020-02-10 20:50:31,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:32,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209596092] [2020-02-10 20:50:32,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:32,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:32,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853277119] [2020-02-10 20:50:32,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:32,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:32,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:32,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:32,175 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:50:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:32,358 INFO L93 Difference]: Finished difference Result 1186 states and 4201 transitions. [2020-02-10 20:50:32,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:32,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:32,362 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:50:32,362 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:50:32,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-02-10 20:50:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:50:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-02-10 20:50:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:50:32,385 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:50:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:32,385 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:50:32,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:50:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:32,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:32,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-02-10 20:50:32,387 INFO L427 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-02-10 20:50:32,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:32,387 INFO L82 PathProgramCache]: Analyzing trace with hash 697139907, now seen corresponding path program 1025 times [2020-02-10 20:50:32,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:32,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136870350] [2020-02-10 20:50:32,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:32,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136870350] [2020-02-10 20:50:32,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:32,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:32,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067031762] [2020-02-10 20:50:32,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:32,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:32,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:32,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:32,773 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:50:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:32,927 INFO L93 Difference]: Finished difference Result 1190 states and 4209 transitions. [2020-02-10 20:50:32,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:32,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:32,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:32,931 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:50:32,931 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:50:32,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-02-10 20:50:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:50:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 20:50:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:50:32,954 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:50:32,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:32,955 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:50:32,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:50:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:32,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:32,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-02-10 20:50:32,956 INFO L427 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-02-10 20:50:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:32,956 INFO L82 PathProgramCache]: Analyzing trace with hash -375945473, now seen corresponding path program 1026 times [2020-02-10 20:50:32,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:32,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260855798] [2020-02-10 20:50:32,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:33,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260855798] [2020-02-10 20:50:33,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:33,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:33,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889282822] [2020-02-10 20:50:33,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:33,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:33,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:33,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:33,327 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:50:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:33,512 INFO L93 Difference]: Finished difference Result 1187 states and 4201 transitions. [2020-02-10 20:50:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:33,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:33,515 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:50:33,515 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:50:33,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-02-10 20:50:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:50:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-02-10 20:50:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:50:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:50:33,538 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:50:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:33,538 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:50:33,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:50:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:33,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:33,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-02-10 20:50:33,539 INFO L427 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-02-10 20:50:33,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:33,539 INFO L82 PathProgramCache]: Analyzing trace with hash -24563171, now seen corresponding path program 1027 times [2020-02-10 20:50:33,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:33,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087142259] [2020-02-10 20:50:33,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:33,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087142259] [2020-02-10 20:50:33,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:33,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:33,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224053283] [2020-02-10 20:50:33,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:33,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:33,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:33,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:33,924 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:50:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:34,116 INFO L93 Difference]: Finished difference Result 1201 states and 4237 transitions. [2020-02-10 20:50:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:34,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:34,119 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 20:50:34,119 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:50:34,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-02-10 20:50:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:50:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 780. [2020-02-10 20:50:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:50:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-02-10 20:50:34,142 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-02-10 20:50:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:34,142 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-02-10 20:50:34,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-02-10 20:50:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:34,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:34,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-02-10 20:50:34,143 INFO L427 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-02-10 20:50:34,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:34,143 INFO L82 PathProgramCache]: Analyzing trace with hash 513292407, now seen corresponding path program 1028 times [2020-02-10 20:50:34,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:34,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146474710] [2020-02-10 20:50:34,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:34,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146474710] [2020-02-10 20:50:34,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:34,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:34,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859333221] [2020-02-10 20:50:34,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:34,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:34,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:34,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:34,519 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:50:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:34,664 INFO L93 Difference]: Finished difference Result 1200 states and 4230 transitions. [2020-02-10 20:50:34,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:34,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:34,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:34,668 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:50:34,668 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:50:34,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-02-10 20:50:34,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:50:34,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-02-10 20:50:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:50:34,691 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:50:34,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:34,691 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:50:34,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:34,691 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:50:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:34,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:34,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-02-10 20:50:34,692 INFO L427 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-02-10 20:50:34,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:34,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1069528417, now seen corresponding path program 1029 times [2020-02-10 20:50:34,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:34,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214709782] [2020-02-10 20:50:34,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:35,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214709782] [2020-02-10 20:50:35,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:35,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:35,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964969052] [2020-02-10 20:50:35,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:35,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:35,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:35,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:35,056 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:50:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:35,244 INFO L93 Difference]: Finished difference Result 1195 states and 4220 transitions. [2020-02-10 20:50:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:35,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:35,247 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:50:35,247 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:50:35,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-02-10 20:50:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:50:35,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-02-10 20:50:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:50:35,270 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:50:35,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:35,270 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:50:35,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:50:35,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:35,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:35,271 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:35,271 INFO L427 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-02-10 20:50:35,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:35,272 INFO L82 PathProgramCache]: Analyzing trace with hash 534298615, now seen corresponding path program 1030 times [2020-02-10 20:50:35,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:35,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140673520] [2020-02-10 20:50:35,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:35,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140673520] [2020-02-10 20:50:35,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:35,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:35,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797058627] [2020-02-10 20:50:35,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:35,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:35,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:35,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:35,644 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:50:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:35,840 INFO L93 Difference]: Finished difference Result 1191 states and 4210 transitions. [2020-02-10 20:50:35,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:35,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:35,844 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:50:35,844 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:50:35,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-02-10 20:50:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:50:35,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 20:50:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:50:35,867 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:50:35,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:35,867 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:50:35,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:35,868 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:50:35,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:35,868 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:35,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-02-10 20:50:35,869 INFO L427 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-02-10 20:50:35,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:35,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1101037729, now seen corresponding path program 1031 times [2020-02-10 20:50:35,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:35,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184702823] [2020-02-10 20:50:35,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:36,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184702823] [2020-02-10 20:50:36,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:36,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:36,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921992262] [2020-02-10 20:50:36,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:36,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:36,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:36,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:36,248 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:50:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:36,439 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-02-10 20:50:36,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:36,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:36,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:36,443 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:50:36,443 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:50:36,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-02-10 20:50:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:50:36,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 777. [2020-02-10 20:50:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:50:36,466 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:50:36,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:36,466 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:50:36,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:50:36,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:36,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:36,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-02-10 20:50:36,467 INFO L427 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-02-10 20:50:36,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:36,467 INFO L82 PathProgramCache]: Analyzing trace with hash 27952349, now seen corresponding path program 1032 times [2020-02-10 20:50:36,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:36,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733322588] [2020-02-10 20:50:36,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:36,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733322588] [2020-02-10 20:50:36,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:36,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:36,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582492364] [2020-02-10 20:50:36,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:36,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:36,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:36,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:36,844 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:50:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:37,040 INFO L93 Difference]: Finished difference Result 1190 states and 4206 transitions. [2020-02-10 20:50:37,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:37,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:37,043 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:50:37,043 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:50:37,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:50:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 771. [2020-02-10 20:50:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:50:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-02-10 20:50:37,067 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-02-10 20:50:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:37,068 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-02-10 20:50:37,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-02-10 20:50:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:37,069 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:37,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-02-10 20:50:37,069 INFO L427 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-02-10 20:50:37,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:37,069 INFO L82 PathProgramCache]: Analyzing trace with hash -24944675, now seen corresponding path program 1033 times [2020-02-10 20:50:37,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:37,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914618208] [2020-02-10 20:50:37,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:37,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914618208] [2020-02-10 20:50:37,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:37,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:37,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429171870] [2020-02-10 20:50:37,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:37,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:37,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:37,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:37,463 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-02-10 20:50:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:37,652 INFO L93 Difference]: Finished difference Result 1187 states and 4209 transitions. [2020-02-10 20:50:37,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:37,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:37,656 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:50:37,656 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:50:37,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-02-10 20:50:37,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:50:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 779. [2020-02-10 20:50:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:50:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 20:50:37,679 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 20:50:37,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:37,680 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 20:50:37,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 20:50:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:37,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:37,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-02-10 20:50:37,681 INFO L427 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-02-10 20:50:37,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:37,681 INFO L82 PathProgramCache]: Analyzing trace with hash 955810043, now seen corresponding path program 1034 times [2020-02-10 20:50:37,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:37,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989171290] [2020-02-10 20:50:37,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:38,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989171290] [2020-02-10 20:50:38,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:38,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:38,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857857374] [2020-02-10 20:50:38,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:38,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:38,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:38,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:38,081 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:50:38,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:38,272 INFO L93 Difference]: Finished difference Result 1186 states and 4204 transitions. [2020-02-10 20:50:38,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:38,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:38,275 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:50:38,275 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:50:38,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-02-10 20:50:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:50:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 776. [2020-02-10 20:50:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:50:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-02-10 20:50:38,298 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-02-10 20:50:38,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:38,298 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-02-10 20:50:38,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-02-10 20:50:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:38,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:38,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-02-10 20:50:38,299 INFO L427 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-02-10 20:50:38,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:38,299 INFO L82 PathProgramCache]: Analyzing trace with hash -467843815, now seen corresponding path program 1035 times [2020-02-10 20:50:38,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:38,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381691063] [2020-02-10 20:50:38,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:38,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381691063] [2020-02-10 20:50:38,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:38,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:38,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559392725] [2020-02-10 20:50:38,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:38,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:38,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:38,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:38,689 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:50:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:38,877 INFO L93 Difference]: Finished difference Result 1190 states and 4213 transitions. [2020-02-10 20:50:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:38,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:38,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:38,881 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:50:38,881 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 20:50:38,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-02-10 20:50:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 20:50:38,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 780. [2020-02-10 20:50:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:50:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-02-10 20:50:38,903 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-02-10 20:50:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:38,904 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-02-10 20:50:38,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-02-10 20:50:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:38,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:38,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-02-10 20:50:38,905 INFO L427 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-02-10 20:50:38,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:38,905 INFO L82 PathProgramCache]: Analyzing trace with hash 533917111, now seen corresponding path program 1036 times [2020-02-10 20:50:38,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:38,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457997489] [2020-02-10 20:50:38,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:39,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457997489] [2020-02-10 20:50:39,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:39,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:39,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652076097] [2020-02-10 20:50:39,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:39,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:39,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:39,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:39,295 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:50:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:39,443 INFO L93 Difference]: Finished difference Result 1191 states and 4211 transitions. [2020-02-10 20:50:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:39,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:39,447 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:50:39,447 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:50:39,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:50:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 776. [2020-02-10 20:50:39,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:50:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-02-10 20:50:39,470 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-02-10 20:50:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:39,470 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-02-10 20:50:39,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-02-10 20:50:39,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:39,471 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:39,471 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:39,471 INFO L427 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-02-10 20:50:39,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:39,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1945627677, now seen corresponding path program 1037 times [2020-02-10 20:50:39,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:39,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580300241] [2020-02-10 20:50:39,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:39,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580300241] [2020-02-10 20:50:39,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:39,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:39,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163071054] [2020-02-10 20:50:39,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:39,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:39,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:39,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:39,888 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:50:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:40,073 INFO L93 Difference]: Finished difference Result 1187 states and 4203 transitions. [2020-02-10 20:50:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:40,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:40,076 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:50:40,076 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:50:40,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-02-10 20:50:40,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:50:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 779. [2020-02-10 20:50:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:50:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:50:40,100 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:50:40,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:40,100 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:50:40,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:50:40,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:40,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:40,101 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:40,101 INFO L427 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-02-10 20:50:40,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash 872542297, now seen corresponding path program 1038 times [2020-02-10 20:50:40,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:40,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489928338] [2020-02-10 20:50:40,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:40,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489928338] [2020-02-10 20:50:40,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:40,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:40,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355650927] [2020-02-10 20:50:40,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:40,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:40,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:40,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:40,489 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:50:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:40,675 INFO L93 Difference]: Finished difference Result 1189 states and 4204 transitions. [2020-02-10 20:50:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:40,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:40,678 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:50:40,678 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:50:40,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-02-10 20:50:40,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:50:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 773. [2020-02-10 20:50:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:50:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:50:40,700 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:50:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:40,701 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:50:40,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:50:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:40,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:40,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:40,702 INFO L427 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-02-10 20:50:40,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:40,702 INFO L82 PathProgramCache]: Analyzing trace with hash -869916127, now seen corresponding path program 1039 times [2020-02-10 20:50:40,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:40,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207237969] [2020-02-10 20:50:40,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:41,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207237969] [2020-02-10 20:50:41,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:41,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:41,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105386739] [2020-02-10 20:50:41,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:41,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:41,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:41,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:41,093 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:50:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:41,278 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-02-10 20:50:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:41,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:41,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:41,282 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:50:41,282 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:50:41,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:50:41,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 778. [2020-02-10 20:50:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:50:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 20:50:41,305 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 20:50:41,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:41,305 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 20:50:41,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 20:50:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:41,306 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:41,306 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:41,306 INFO L427 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-02-10 20:50:41,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:41,307 INFO L82 PathProgramCache]: Analyzing trace with hash 110838591, now seen corresponding path program 1040 times [2020-02-10 20:50:41,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:41,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669001380] [2020-02-10 20:50:41,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:41,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669001380] [2020-02-10 20:50:41,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:41,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:41,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940503565] [2020-02-10 20:50:41,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:41,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:41,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:41,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:41,700 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:50:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:41,847 INFO L93 Difference]: Finished difference Result 1179 states and 4183 transitions. [2020-02-10 20:50:41,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:41,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:41,850 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:50:41,850 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 20:50:41,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-02-10 20:50:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 20:50:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-02-10 20:50:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:50:41,873 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:50:41,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:41,873 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:50:41,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:50:41,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:41,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:41,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-02-10 20:50:41,874 INFO L427 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-02-10 20:50:41,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1755714407, now seen corresponding path program 1041 times [2020-02-10 20:50:41,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:41,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162474998] [2020-02-10 20:50:41,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:42,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162474998] [2020-02-10 20:50:42,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:42,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:42,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373163834] [2020-02-10 20:50:42,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:42,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:42,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:42,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:42,261 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:50:42,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:42,448 INFO L93 Difference]: Finished difference Result 1178 states and 4181 transitions. [2020-02-10 20:50:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:42,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:42,452 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 20:50:42,452 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:50:42,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-02-10 20:50:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:50:42,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-02-10 20:50:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:50:42,475 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:50:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:42,475 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:50:42,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:50:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:42,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:42,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-02-10 20:50:42,476 INFO L427 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-02-10 20:50:42,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:42,477 INFO L82 PathProgramCache]: Analyzing trace with hash -732947273, now seen corresponding path program 1042 times [2020-02-10 20:50:42,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:42,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623316853] [2020-02-10 20:50:42,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:42,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623316853] [2020-02-10 20:50:42,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:42,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:42,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38282698] [2020-02-10 20:50:42,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:42,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:42,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:42,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:42,871 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:50:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:43,013 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-02-10 20:50:43,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:43,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:43,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:43,017 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 20:50:43,018 INFO L226 Difference]: Without dead ends: 1163 [2020-02-10 20:50:43,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-02-10 20:50:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-02-10 20:50:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 775. [2020-02-10 20:50:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:50:43,043 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:50:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:43,043 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:50:43,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:50:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:43,044 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:43,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:43,044 INFO L427 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-02-10 20:50:43,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:43,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1751848673, now seen corresponding path program 1043 times [2020-02-10 20:50:43,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:43,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911120025] [2020-02-10 20:50:43,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:43,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911120025] [2020-02-10 20:50:43,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:43,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:43,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183643777] [2020-02-10 20:50:43,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:43,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:43,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:43,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:43,453 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:50:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:43,596 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-02-10 20:50:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:43,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:43,599 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 20:50:43,599 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 20:50:43,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 20:50:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 777. [2020-02-10 20:50:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:50:43,622 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:50:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:43,622 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:50:43,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:50:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:43,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:43,623 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:43,623 INFO L427 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-02-10 20:50:43,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:43,624 INFO L82 PathProgramCache]: Analyzing trace with hash -394322087, now seen corresponding path program 1044 times [2020-02-10 20:50:43,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:43,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493476791] [2020-02-10 20:50:43,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:44,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493476791] [2020-02-10 20:50:44,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:44,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:44,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797482555] [2020-02-10 20:50:44,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:44,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:44,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:44,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:44,023 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:50:44,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:44,150 INFO L93 Difference]: Finished difference Result 1175 states and 4171 transitions. [2020-02-10 20:50:44,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:44,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:44,154 INFO L225 Difference]: With dead ends: 1175 [2020-02-10 20:50:44,154 INFO L226 Difference]: Without dead ends: 1160 [2020-02-10 20:50:44,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:44,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2020-02-10 20:50:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 773. [2020-02-10 20:50:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:50:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:50:44,177 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:50:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:44,177 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:50:44,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:50:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:44,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:44,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-02-10 20:50:44,179 INFO L427 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-02-10 20:50:44,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:44,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2137180577, now seen corresponding path program 1045 times [2020-02-10 20:50:44,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:44,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742914318] [2020-02-10 20:50:44,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:44,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742914318] [2020-02-10 20:50:44,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:44,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:44,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291041260] [2020-02-10 20:50:44,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:44,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:44,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:44,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:44,569 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:50:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:44,701 INFO L93 Difference]: Finished difference Result 1186 states and 4200 transitions. [2020-02-10 20:50:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:44,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:44,705 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:50:44,705 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:50:44,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-02-10 20:50:44,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:50:44,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 779. [2020-02-10 20:50:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:50:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:50:44,728 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:50:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:44,728 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:50:44,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:44,729 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:50:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:44,730 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:44,730 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:44,730 INFO L427 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-02-10 20:50:44,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:44,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1156025793, now seen corresponding path program 1046 times [2020-02-10 20:50:44,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:44,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279787968] [2020-02-10 20:50:44,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:45,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279787968] [2020-02-10 20:50:45,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:45,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:45,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706056391] [2020-02-10 20:50:45,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:45,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:45,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:45,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:45,117 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:50:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:45,250 INFO L93 Difference]: Finished difference Result 1187 states and 4198 transitions. [2020-02-10 20:50:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:45,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:45,254 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:50:45,254 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:50:45,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:50:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-02-10 20:50:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:50:45,277 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:50:45,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:45,277 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:50:45,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:50:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:45,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:45,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-02-10 20:50:45,279 INFO L427 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-02-10 20:50:45,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:45,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1694281437, now seen corresponding path program 1047 times [2020-02-10 20:50:45,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:45,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101259636] [2020-02-10 20:50:45,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:45,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101259636] [2020-02-10 20:50:45,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:45,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:45,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656519278] [2020-02-10 20:50:45,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:45,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:45,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:45,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:45,665 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:50:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:45,800 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-02-10 20:50:45,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:45,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:45,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:45,804 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:50:45,804 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:50:45,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-02-10 20:50:45,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:50:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 20:50:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:50:45,827 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:50:45,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:45,828 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:50:45,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:50:45,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:45,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:45,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-02-10 20:50:45,829 INFO L427 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-02-10 20:50:45,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:45,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1577918725, now seen corresponding path program 1048 times [2020-02-10 20:50:45,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:45,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664534480] [2020-02-10 20:50:45,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:46,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664534480] [2020-02-10 20:50:46,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:46,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:46,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227208089] [2020-02-10 20:50:46,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:46,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:46,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:46,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:46,222 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:50:46,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:46,380 INFO L93 Difference]: Finished difference Result 1179 states and 4180 transitions. [2020-02-10 20:50:46,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:46,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:46,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:46,384 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:50:46,384 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:50:46,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:50:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-02-10 20:50:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:50:46,407 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:50:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:46,407 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:50:46,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:50:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:46,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:46,408 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:46,408 INFO L427 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-02-10 20:50:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:46,409 INFO L82 PathProgramCache]: Analyzing trace with hash 484984289, now seen corresponding path program 1049 times [2020-02-10 20:50:46,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:46,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868974253] [2020-02-10 20:50:46,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:46,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868974253] [2020-02-10 20:50:46,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:46,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:46,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768599017] [2020-02-10 20:50:46,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:46,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:46,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:46,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:46,808 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:50:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:46,945 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-02-10 20:50:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:46,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:46,948 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:50:46,948 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:50:46,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:50:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 20:50:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:46,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:50:46,971 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:50:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:46,971 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:50:46,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:50:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:46,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:46,972 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:46,972 INFO L427 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-02-10 20:50:46,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:46,973 INFO L82 PathProgramCache]: Analyzing trace with hash -588101091, now seen corresponding path program 1050 times [2020-02-10 20:50:46,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:46,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107618726] [2020-02-10 20:50:46,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:47,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107618726] [2020-02-10 20:50:47,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:47,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:47,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012286075] [2020-02-10 20:50:47,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:47,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:47,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:47,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:47,348 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:50:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:47,498 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-02-10 20:50:47,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:47,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:47,501 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:50:47,502 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:50:47,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:47,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:50:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-02-10 20:50:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:50:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:50:47,524 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:50:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:47,524 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:50:47,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:50:47,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:47,525 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:47,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:47,526 INFO L427 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-02-10 20:50:47,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:47,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1277332667, now seen corresponding path program 1051 times [2020-02-10 20:50:47,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:47,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723769847] [2020-02-10 20:50:47,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:47,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723769847] [2020-02-10 20:50:47,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:47,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:47,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095098300] [2020-02-10 20:50:47,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:47,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:47,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:47,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:47,915 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:50:48,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:48,051 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-02-10 20:50:48,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:48,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:48,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:48,055 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:50:48,055 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:50:48,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-02-10 20:50:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:50:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 778. [2020-02-10 20:50:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:50:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-02-10 20:50:48,077 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-02-10 20:50:48,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:48,078 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-02-10 20:50:48,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-02-10 20:50:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:48,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:48,079 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:48,079 INFO L427 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-02-10 20:50:48,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:48,079 INFO L82 PathProgramCache]: Analyzing trace with hash 204247287, now seen corresponding path program 1052 times [2020-02-10 20:50:48,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:48,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827944220] [2020-02-10 20:50:48,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:48,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827944220] [2020-02-10 20:50:48,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:48,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:48,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109506759] [2020-02-10 20:50:48,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:48,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:48,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:48,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:48,465 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:50:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:48,618 INFO L93 Difference]: Finished difference Result 1183 states and 4187 transitions. [2020-02-10 20:50:48,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:48,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:48,621 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:50:48,621 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:50:48,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-02-10 20:50:48,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:50:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-02-10 20:50:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:50:48,643 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:50:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:48,643 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:50:48,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:50:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:48,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:48,645 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:48,645 INFO L427 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-02-10 20:50:48,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:48,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1923543041, now seen corresponding path program 1053 times [2020-02-10 20:50:48,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:48,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655618239] [2020-02-10 20:50:48,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:49,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655618239] [2020-02-10 20:50:49,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:49,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:49,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780349785] [2020-02-10 20:50:49,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:49,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:49,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:49,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:49,039 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:50:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:49,166 INFO L93 Difference]: Finished difference Result 1177 states and 4175 transitions. [2020-02-10 20:50:49,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:49,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:49,170 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 20:50:49,170 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:50:49,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-02-10 20:50:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:50:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-02-10 20:50:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:50:49,193 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:50:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:49,193 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:50:49,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:50:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:49,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50: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-02-10 20:50:49,194 INFO L427 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-02-10 20:50:49,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash 225253495, now seen corresponding path program 1054 times [2020-02-10 20:50:49,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:49,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346236885] [2020-02-10 20:50:49,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:49,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:49,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346236885] [2020-02-10 20:50:49,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:49,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:49,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026155206] [2020-02-10 20:50:49,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:49,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:49,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:49,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:49,606 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:50:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:49,759 INFO L93 Difference]: Finished difference Result 1176 states and 4171 transitions. [2020-02-10 20:50:49,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:49,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:49,762 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 20:50:49,762 INFO L226 Difference]: Without dead ends: 1163 [2020-02-10 20:50:49,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-02-10 20:50:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-02-10 20:50:49,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 775. [2020-02-10 20:50:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:50:49,784 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:50:49,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:49,784 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:50:49,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:50:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:49,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:49,786 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:49,786 INFO L427 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-02-10 20:50:49,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:49,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1902536833, now seen corresponding path program 1055 times [2020-02-10 20:50:49,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:49,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62538849] [2020-02-10 20:50:49,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:50,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62538849] [2020-02-10 20:50:50,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:50,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:50,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740249758] [2020-02-10 20:50:50,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:50,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:50,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:50,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:50,168 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:50:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:50,316 INFO L93 Difference]: Finished difference Result 1181 states and 4181 transitions. [2020-02-10 20:50:50,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:50,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:50,319 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:50:50,319 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:50:50,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-02-10 20:50:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:50:50,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 777. [2020-02-10 20:50:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:50:50,341 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:50:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:50,341 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:50:50,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:50:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:50,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:50,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-02-10 20:50:50,343 INFO L427 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-02-10 20:50:50,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:50,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1319345083, now seen corresponding path program 1056 times [2020-02-10 20:50:50,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:50,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399391603] [2020-02-10 20:50:50,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:50,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399391603] [2020-02-10 20:50:50,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:50,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:50,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950510457] [2020-02-10 20:50:50,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:50,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:50,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:50,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:50,732 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:50:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:50,861 INFO L93 Difference]: Finished difference Result 1178 states and 4173 transitions. [2020-02-10 20:50:50,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:50,862 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:50,865 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 20:50:50,865 INFO L226 Difference]: Without dead ends: 1161 [2020-02-10 20:50:50,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-02-10 20:50:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-02-10 20:50:50,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 771. [2020-02-10 20:50:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:50:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-02-10 20:50:50,887 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-02-10 20:50:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:50,888 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-02-10 20:50:50,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-02-10 20:50:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:50,889 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:50,889 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:50,889 INFO L427 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-02-10 20:50:50,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:50,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1231567229, now seen corresponding path program 1057 times [2020-02-10 20:50:50,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:50,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363932453] [2020-02-10 20:50:50,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:51,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363932453] [2020-02-10 20:50:51,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:51,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:51,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766050921] [2020-02-10 20:50:51,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:51,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:51,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:51,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:51,263 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-02-10 20:50:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:51,393 INFO L93 Difference]: Finished difference Result 1197 states and 4229 transitions. [2020-02-10 20:50:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:51,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:51,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:51,396 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 20:50:51,396 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:50:51,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:50:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 20:50:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:50:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 20:50:51,419 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 20:50:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:51,419 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 20:50:51,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 20:50:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:51,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:51,421 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:51,421 INFO L427 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-02-10 20:50:51,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:51,421 INFO L82 PathProgramCache]: Analyzing trace with hash 379373729, now seen corresponding path program 1058 times [2020-02-10 20:50:51,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:51,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263298242] [2020-02-10 20:50:51,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:51,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263298242] [2020-02-10 20:50:51,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:51,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:51,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005435648] [2020-02-10 20:50:51,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:51,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:51,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:51,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:51,802 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:50:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:51,929 INFO L93 Difference]: Finished difference Result 1194 states and 4220 transitions. [2020-02-10 20:50:51,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:51,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:51,933 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:50:51,933 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:50:51,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-02-10 20:50:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:50:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 776. [2020-02-10 20:50:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:50:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3094 transitions. [2020-02-10 20:50:51,956 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3094 transitions. Word has length 25 [2020-02-10 20:50:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:51,956 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3094 transitions. [2020-02-10 20:50:51,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3094 transitions. [2020-02-10 20:50:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:51,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:51,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-02-10 20:50:51,958 INFO L427 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-02-10 20:50:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:51,958 INFO L82 PathProgramCache]: Analyzing trace with hash -137475641, now seen corresponding path program 1059 times [2020-02-10 20:50:51,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:51,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010182266] [2020-02-10 20:50:51,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:52,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010182266] [2020-02-10 20:50:52,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:52,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:52,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566823116] [2020-02-10 20:50:52,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:52,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:52,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:52,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:52,351 INFO L87 Difference]: Start difference. First operand 776 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:50:52,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:52,478 INFO L93 Difference]: Finished difference Result 1201 states and 4236 transitions. [2020-02-10 20:50:52,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:52,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:52,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:52,481 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 20:50:52,482 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:50:52,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-02-10 20:50:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:50:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 781. [2020-02-10 20:50:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:50:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3103 transitions. [2020-02-10 20:50:52,511 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3103 transitions. Word has length 25 [2020-02-10 20:50:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:52,512 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3103 transitions. [2020-02-10 20:50:52,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3103 transitions. [2020-02-10 20:50:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:52,513 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:52,513 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:52,513 INFO L427 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-02-10 20:50:52,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:52,513 INFO L82 PathProgramCache]: Analyzing trace with hash 400379937, now seen corresponding path program 1060 times [2020-02-10 20:50:52,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:52,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083349870] [2020-02-10 20:50:52,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:52,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083349870] [2020-02-10 20:50:52,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:52,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:52,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246195486] [2020-02-10 20:50:52,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:52,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:52,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:52,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:52,897 INFO L87 Difference]: Start difference. First operand 781 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:50:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:53,026 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-02-10 20:50:53,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:53,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:53,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:53,030 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:50:53,030 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:50:53,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-02-10 20:50:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:50:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 776. [2020-02-10 20:50:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:50:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3091 transitions. [2020-02-10 20:50:53,052 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3091 transitions. Word has length 25 [2020-02-10 20:50:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:53,053 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3091 transitions. [2020-02-10 20:50:53,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3091 transitions. [2020-02-10 20:50:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:53,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:53,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-02-10 20:50:53,054 INFO L427 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-02-10 20:50:53,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:53,054 INFO L82 PathProgramCache]: Analyzing trace with hash -126972537, now seen corresponding path program 1061 times [2020-02-10 20:50:53,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:53,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582272500] [2020-02-10 20:50:53,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:53,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582272500] [2020-02-10 20:50:53,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:53,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:53,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094289269] [2020-02-10 20:50:53,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:53,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:53,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:53,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:53,429 INFO L87 Difference]: Start difference. First operand 776 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:50:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:53,566 INFO L93 Difference]: Finished difference Result 1193 states and 4215 transitions. [2020-02-10 20:50:53,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:53,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:53,569 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:50:53,569 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:50:53,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:53,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:50:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-02-10 20:50:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:50:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 20:50:53,593 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 20:50:53,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:53,593 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 20:50:53,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 20:50:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:53,594 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:53,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-02-10 20:50:53,595 INFO L427 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-02-10 20:50:53,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:53,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1200057917, now seen corresponding path program 1062 times [2020-02-10 20:50:53,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:53,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849266042] [2020-02-10 20:50:53,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:53,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:53,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849266042] [2020-02-10 20:50:53,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:53,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:53,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730074227] [2020-02-10 20:50:53,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:53,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:53,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:53,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:53,993 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:50:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:54,124 INFO L93 Difference]: Finished difference Result 1195 states and 4216 transitions. [2020-02-10 20:50:54,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:54,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:54,128 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:50:54,128 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:50:54,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:54,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:50:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 773. [2020-02-10 20:50:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:50:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:50:54,151 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:50:54,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:54,151 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:50:54,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:50:54,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:54,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:54,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:50:54,153 INFO L427 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-02-10 20:50:54,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:54,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1674466369, now seen corresponding path program 1063 times [2020-02-10 20:50:54,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:54,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911873852] [2020-02-10 20:50:54,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:54,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911873852] [2020-02-10 20:50:54,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:54,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:54,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685181672] [2020-02-10 20:50:54,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:54,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:54,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:54,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:54,534 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:50:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:54,664 INFO L93 Difference]: Finished difference Result 1189 states and 4205 transitions. [2020-02-10 20:50:54,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:54,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:54,668 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:50:54,668 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:50: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-02-10 20:50:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:50:54,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 778. [2020-02-10 20:50:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:50:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 20:50:54,691 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 20:50:54,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:54,691 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 20:50:54,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:54,692 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 20:50:54,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:54,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:54,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-02-10 20:50:54,693 INFO L427 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-02-10 20:50:54,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:54,693 INFO L82 PathProgramCache]: Analyzing trace with hash -63525411, now seen corresponding path program 1064 times [2020-02-10 20:50:54,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:54,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589963212] [2020-02-10 20:50:54,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:55,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589963212] [2020-02-10 20:50:55,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:55,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:55,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923057053] [2020-02-10 20:50:55,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:55,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:55,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:55,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:55,069 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:50:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:55,204 INFO L93 Difference]: Finished difference Result 1186 states and 4196 transitions. [2020-02-10 20:50:55,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:55,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:55,208 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:50:55,208 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:50:55,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-02-10 20:50:55,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:50:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 20:50:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:50:55,232 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:50:55,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:55,232 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:50:55,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:55,232 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:50:55,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:55,233 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:55,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-02-10 20:50:55,233 INFO L427 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-02-10 20:50:55,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:55,233 INFO L82 PathProgramCache]: Analyzing trace with hash 513716807, now seen corresponding path program 1065 times [2020-02-10 20:50:55,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:55,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066861170] [2020-02-10 20:50:55,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:55,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066861170] [2020-02-10 20:50:55,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:55,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:55,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681551856] [2020-02-10 20:50:55,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:55,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:55,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:55,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:55,603 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:50:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:55,731 INFO L93 Difference]: Finished difference Result 1187 states and 4198 transitions. [2020-02-10 20:50:55,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:55,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:55,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:55,735 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:50:55,735 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:50:55,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-02-10 20:50:55,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:50:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 20:50:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:50:55,758 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:50:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:55,759 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:50:55,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:50:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:55,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:55,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-02-10 20:50:55,760 INFO L427 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-02-10 20:50:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:55,760 INFO L82 PathProgramCache]: Analyzing trace with hash -21512995, now seen corresponding path program 1066 times [2020-02-10 20:50:55,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:55,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901256757] [2020-02-10 20:50:55,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:56,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901256757] [2020-02-10 20:50:56,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:56,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:56,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722569146] [2020-02-10 20:50:56,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:56,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:56,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:56,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:56,135 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:50:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:56,290 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-02-10 20:50:56,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:56,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:56,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:56,294 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:50:56,294 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:50:56,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-02-10 20:50:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:50:56,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-02-10 20:50:56,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:50:56,317 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:50:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:56,317 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:50:56,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:50:56,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:56,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:56,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-02-10 20:50:56,318 INFO L427 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-02-10 20:50:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:56,319 INFO L82 PathProgramCache]: Analyzing trace with hash 524219911, now seen corresponding path program 1067 times [2020-02-10 20:50:56,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:56,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312180786] [2020-02-10 20:50:56,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:56,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312180786] [2020-02-10 20:50:56,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:56,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:56,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116484371] [2020-02-10 20:50:56,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:56,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:56,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:56,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:56,695 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:50:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:56,829 INFO L93 Difference]: Finished difference Result 1181 states and 4184 transitions. [2020-02-10 20:50:56,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:56,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:56,833 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:50:56,833 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:50:56,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:50:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 20:50:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:50:56,857 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:50:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:56,857 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:50:56,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:50:56,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:56,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:56,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-02-10 20:50:56,858 INFO L427 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-02-10 20:50:56,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:56,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1621950849, now seen corresponding path program 1068 times [2020-02-10 20:50:56,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:56,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348931423] [2020-02-10 20:50:56,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:57,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-02-10 20:50:57,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348931423] [2020-02-10 20:50:57,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:57,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:57,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891713402] [2020-02-10 20:50:57,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:57,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:57,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:57,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:57,240 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:50:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:57,381 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-02-10 20:50:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:57,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:57,385 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:50:57,385 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:50:57,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-02-10 20:50:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:50:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-02-10 20:50:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:50:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:50:57,419 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:50:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:57,419 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:50:57,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:50:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:57,420 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:57,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-02-10 20:50:57,421 INFO L427 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-02-10 20:50:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:57,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1023273921, now seen corresponding path program 1069 times [2020-02-10 20:50:57,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:57,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102042016] [2020-02-10 20:50:57,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:57,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102042016] [2020-02-10 20:50:57,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:57,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:57,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843633676] [2020-02-10 20:50:57,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:57,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:57,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:57,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:57,804 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:50:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:57,937 INFO L93 Difference]: Finished difference Result 1197 states and 4223 transitions. [2020-02-10 20:50:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:57,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:57,940 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 20:50:57,941 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:50:57,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-02-10 20:50:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:50:57,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 780. [2020-02-10 20:50:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:50:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3098 transitions. [2020-02-10 20:50:57,964 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3098 transitions. Word has length 25 [2020-02-10 20:50:57,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:57,964 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3098 transitions. [2020-02-10 20:50:57,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3098 transitions. [2020-02-10 20:50:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:57,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:57,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-02-10 20:50:57,965 INFO L427 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-02-10 20:50:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:57,966 INFO L82 PathProgramCache]: Analyzing trace with hash -485418343, now seen corresponding path program 1070 times [2020-02-10 20:50:57,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:57,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658875585] [2020-02-10 20:50:57,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:58,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658875585] [2020-02-10 20:50:58,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:58,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:58,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911705931] [2020-02-10 20:50:58,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:58,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:58,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:58,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:58,346 INFO L87 Difference]: Start difference. First operand 780 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:50:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:58,483 INFO L93 Difference]: Finished difference Result 1196 states and 4216 transitions. [2020-02-10 20:50:58,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:58,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:58,486 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:50:58,486 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 20:50:58,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-02-10 20:50:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 20:50:58,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-02-10 20:50:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:50:58,509 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:50:58,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:58,509 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:50:58,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:50:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:58,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:58,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-02-10 20:50:58,510 INFO L427 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-02-10 20:50:58,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:58,510 INFO L82 PathProgramCache]: Analyzing trace with hash 70817667, now seen corresponding path program 1071 times [2020-02-10 20:50:58,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:58,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451050985] [2020-02-10 20:50:58,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:58,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451050985] [2020-02-10 20:50:58,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:58,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:58,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085935877] [2020-02-10 20:50:58,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:58,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:58,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:58,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:58,891 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:50:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:59,024 INFO L93 Difference]: Finished difference Result 1191 states and 4206 transitions. [2020-02-10 20:50:59,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:59,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:59,028 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:50:59,028 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:50:59,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-02-10 20:50:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:50:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 20:50:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:50:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:50:59,051 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:50:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:59,052 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:50:59,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:50:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:59,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:59,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-02-10 20:50:59,053 INFO L427 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-02-10 20:50:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:59,053 INFO L82 PathProgramCache]: Analyzing trace with hash -464412135, now seen corresponding path program 1072 times [2020-02-10 20:50:59,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:59,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943071767] [2020-02-10 20:50:59,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:59,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943071767] [2020-02-10 20:50:59,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:59,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:59,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461170525] [2020-02-10 20:50:59,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:59,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:59,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:59,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:59,431 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:50:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:50:59,591 INFO L93 Difference]: Finished difference Result 1187 states and 4196 transitions. [2020-02-10 20:50:59,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:50:59,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:50:59,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:50:59,594 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:50:59,595 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:50:59,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:50:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:50:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-02-10 20:50:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:50:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:50:59,617 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:50:59,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:50:59,617 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:50:59,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:50:59,618 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:50:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:50:59,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:50:59,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-02-10 20:50:59,619 INFO L427 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-02-10 20:50:59,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:50:59,619 INFO L82 PathProgramCache]: Analyzing trace with hash 102326979, now seen corresponding path program 1073 times [2020-02-10 20:50:59,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:50:59,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763040252] [2020-02-10 20:50:59,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:50:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:50:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:50:59,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763040252] [2020-02-10 20:50:59,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:50:59,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:50:59,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70784742] [2020-02-10 20:50:59,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:50:59,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:50:59,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:50:59,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:50:59,999 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:51:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:00,139 INFO L93 Difference]: Finished difference Result 1189 states and 4200 transitions. [2020-02-10 20:51:00,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:00,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:00,143 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:51:00,143 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:51:00,143 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:00,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:51:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 20:51:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:51:00,166 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:51:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:00,166 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:51:00,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:51:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:00,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:00,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:00,168 INFO L427 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-02-10 20:51:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash -970758401, now seen corresponding path program 1074 times [2020-02-10 20:51:00,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:00,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520353582] [2020-02-10 20:51:00,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:00,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520353582] [2020-02-10 20:51:00,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:00,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:00,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675639795] [2020-02-10 20:51:00,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:00,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:00,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:00,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:00,553 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:51:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:00,715 INFO L93 Difference]: Finished difference Result 1186 states and 4192 transitions. [2020-02-10 20:51:00,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:00,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:00,719 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:51:00,719 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:51:00,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-02-10 20:51:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:51:00,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-02-10 20:51:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:51:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 20:51:00,742 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 20:51:00,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:00,742 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 20:51:00,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:00,742 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 20:51:00,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:00,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:00,743 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:00,743 INFO L427 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-02-10 20:51:00,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:00,744 INFO L82 PathProgramCache]: Analyzing trace with hash 913263261, now seen corresponding path program 1075 times [2020-02-10 20:51:00,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:00,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161739564] [2020-02-10 20:51:00,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:01,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161739564] [2020-02-10 20:51:01,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:01,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:01,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703770032] [2020-02-10 20:51:01,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:01,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:01,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:01,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:01,129 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 20:51:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:01,265 INFO L93 Difference]: Finished difference Result 1184 states and 4191 transitions. [2020-02-10 20:51:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:01,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:01,268 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:51:01,269 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:51:01,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:51:01,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-02-10 20:51:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:51:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-02-10 20:51:01,292 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-02-10 20:51:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:01,292 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-02-10 20:51:01,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-02-10 20:51:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:01,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:01,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-02-10 20:51:01,293 INFO L427 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-02-10 20:51:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:01,293 INFO L82 PathProgramCache]: Analyzing trace with hash -159822119, now seen corresponding path program 1076 times [2020-02-10 20:51:01,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:01,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5611356] [2020-02-10 20:51:01,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:01,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5611356] [2020-02-10 20:51:01,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:01,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:01,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441252935] [2020-02-10 20:51:01,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:01,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:01,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:01,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:01,667 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:51:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:01,801 INFO L93 Difference]: Finished difference Result 1186 states and 4192 transitions. [2020-02-10 20:51:01,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:01,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:01,805 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:51:01,805 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:51:01,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-02-10 20:51:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:51:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-02-10 20:51:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:51:01,828 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:51:01,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:01,829 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:51:01,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:51:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:01,830 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:01,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-02-10 20:51:01,830 INFO L427 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-02-10 20:51:01,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:01,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2007354849, now seen corresponding path program 1077 times [2020-02-10 20:51:01,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:01,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944270296] [2020-02-10 20:51:01,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:02,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944270296] [2020-02-10 20:51:02,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:02,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:02,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106908630] [2020-02-10 20:51:02,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:02,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:02,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:02,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:02,211 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:51:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:02,339 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-02-10 20:51:02,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:02,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:02,343 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:51:02,343 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:51:02,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-02-10 20:51:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:51:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 20:51:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:51:02,365 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:51:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:02,366 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:51:02,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:51:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:02,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:02,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-02-10 20:51:02,367 INFO L427 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-02-10 20:51:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:02,367 INFO L82 PathProgramCache]: Analyzing trace with hash -138815911, now seen corresponding path program 1078 times [2020-02-10 20:51:02,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:02,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107614293] [2020-02-10 20:51:02,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:02,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107614293] [2020-02-10 20:51:02,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:02,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:02,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194963270] [2020-02-10 20:51:02,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:02,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:02,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:02,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:02,748 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:51:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:02,902 INFO L93 Difference]: Finished difference Result 1179 states and 4176 transitions. [2020-02-10 20:51:02,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:02,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:02,906 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:51:02,906 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:51:02,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:02,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:51:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-02-10 20:51:02,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:51:02,928 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:51:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:02,928 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:51:02,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:51:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:02,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:02,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:02,930 INFO L427 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-02-10 20:51:02,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:02,930 INFO L82 PathProgramCache]: Analyzing trace with hash 2028361057, now seen corresponding path program 1079 times [2020-02-10 20:51:02,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:02,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952534267] [2020-02-10 20:51:02,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:03,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952534267] [2020-02-10 20:51:03,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:03,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:03,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644865936] [2020-02-10 20:51:03,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:03,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:03,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:03,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:03,319 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:51:03,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:03,469 INFO L93 Difference]: Finished difference Result 1184 states and 4186 transitions. [2020-02-10 20:51:03,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:03,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:03,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:03,473 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:51:03,473 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:51:03,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:51:03,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:51:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:51:03,497 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:51:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:03,497 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:51:03,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:51:03,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:03,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:03,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:03,498 INFO L427 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-02-10 20:51:03,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:03,498 INFO L82 PathProgramCache]: Analyzing trace with hash 955275677, now seen corresponding path program 1080 times [2020-02-10 20:51:03,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:03,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715822810] [2020-02-10 20:51:03,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:03,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715822810] [2020-02-10 20:51:03,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:03,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:03,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877428899] [2020-02-10 20:51:03,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:03,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:03,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:03,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:03,881 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:51:04,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:04,041 INFO L93 Difference]: Finished difference Result 1181 states and 4178 transitions. [2020-02-10 20:51:04,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:04,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:04,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:04,045 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:51:04,045 INFO L226 Difference]: Without dead ends: 1162 [2020-02-10 20:51:04,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-02-10 20:51:04,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 769. [2020-02-10 20:51:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 20:51:04,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3072 transitions. [2020-02-10 20:51:04,069 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3072 transitions. Word has length 25 [2020-02-10 20:51:04,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:04,070 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3072 transitions. [2020-02-10 20:51:04,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3072 transitions. [2020-02-10 20:51:04,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:04,071 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:04,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-02-10 20:51:04,071 INFO L427 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-02-10 20:51:04,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:04,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1755725605, now seen corresponding path program 1081 times [2020-02-10 20:51:04,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:04,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277247904] [2020-02-10 20:51:04,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51: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-02-10 20:51:04,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277247904] [2020-02-10 20:51:04,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:04,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:04,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565723268] [2020-02-10 20:51:04,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:04,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:04,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:04,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:04,441 INFO L87 Difference]: Start difference. First operand 769 states and 3072 transitions. Second operand 10 states. [2020-02-10 20:51:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:04,580 INFO L93 Difference]: Finished difference Result 1246 states and 4389 transitions. [2020-02-10 20:51:04,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:04,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:04,583 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:51:04,583 INFO L226 Difference]: Without dead ends: 1233 [2020-02-10 20:51:04,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-02-10 20:51:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-02-10 20:51:04,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 783. [2020-02-10 20:51:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:51:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3124 transitions. [2020-02-10 20:51:04,606 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3124 transitions. Word has length 25 [2020-02-10 20:51:04,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:04,607 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3124 transitions. [2020-02-10 20:51:04,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:04,607 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3124 transitions. [2020-02-10 20:51:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:04,608 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:04,608 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:04,608 INFO L427 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-02-10 20:51:04,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:04,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1568990077, now seen corresponding path program 1082 times [2020-02-10 20:51:04,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:04,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531387573] [2020-02-10 20:51:04,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:04,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531387573] [2020-02-10 20:51:04,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:04,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:04,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794229537] [2020-02-10 20:51:04,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:04,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:04,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:04,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:04,987 INFO L87 Difference]: Start difference. First operand 783 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:51:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:05,127 INFO L93 Difference]: Finished difference Result 1248 states and 4389 transitions. [2020-02-10 20:51:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:05,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:05,130 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 20:51:05,130 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 20:51:05,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-02-10 20:51:05,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 20:51:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 779. [2020-02-10 20:51:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:51:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3113 transitions. [2020-02-10 20:51:05,154 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3113 transitions. Word has length 25 [2020-02-10 20:51:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:05,154 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3113 transitions. [2020-02-10 20:51:05,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3113 transitions. [2020-02-10 20:51:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:05,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:05,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-02-10 20:51:05,155 INFO L427 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-02-10 20:51:05,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:05,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1312826465, now seen corresponding path program 1083 times [2020-02-10 20:51:05,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:05,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716257391] [2020-02-10 20:51:05,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:05,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716257391] [2020-02-10 20:51:05,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:05,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:05,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483268131] [2020-02-10 20:51:05,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:05,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:05,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:05,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:05,519 INFO L87 Difference]: Start difference. First operand 779 states and 3113 transitions. Second operand 10 states. [2020-02-10 20:51:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:05,651 INFO L93 Difference]: Finished difference Result 1247 states and 4387 transitions. [2020-02-10 20:51:05,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:05,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:05,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:05,655 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 20:51:05,655 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 20:51:05,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-02-10 20:51:05,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 20:51:05,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 783. [2020-02-10 20:51:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:51:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3120 transitions. [2020-02-10 20:51:05,678 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3120 transitions. Word has length 25 [2020-02-10 20:51:05,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:05,678 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3120 transitions. [2020-02-10 20:51:05,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3120 transitions. [2020-02-10 20:51:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:05,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:05,680 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:05,680 INFO L427 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-02-10 20:51:05,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:05,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1990883009, now seen corresponding path program 1084 times [2020-02-10 20:51:05,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:05,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665987261] [2020-02-10 20:51:05,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:06,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665987261] [2020-02-10 20:51:06,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:06,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:06,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742210560] [2020-02-10 20:51:06,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:06,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:06,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:06,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:06,060 INFO L87 Difference]: Start difference. First operand 783 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:51:06,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:06,236 INFO L93 Difference]: Finished difference Result 1250 states and 4389 transitions. [2020-02-10 20:51:06,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:06,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:06,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:06,239 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:51:06,239 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 20:51:06,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-02-10 20:51:06,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 20:51:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 779. [2020-02-10 20:51:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:51:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3109 transitions. [2020-02-10 20:51:06,262 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3109 transitions. Word has length 25 [2020-02-10 20:51:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:06,262 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3109 transitions. [2020-02-10 20:51:06,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3109 transitions. [2020-02-10 20:51:06,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:06,264 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:06,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-02-10 20:51:06,264 INFO L427 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-02-10 20:51:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash -904768667, now seen corresponding path program 1085 times [2020-02-10 20:51:06,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:06,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454543195] [2020-02-10 20:51:06,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:06,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454543195] [2020-02-10 20:51:06,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:06,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:06,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919178451] [2020-02-10 20:51:06,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:06,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:06,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:06,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:06,648 INFO L87 Difference]: Start difference. First operand 779 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:51:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:06,788 INFO L93 Difference]: Finished difference Result 1253 states and 4397 transitions. [2020-02-10 20:51:06,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:06,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:06,792 INFO L225 Difference]: With dead ends: 1253 [2020-02-10 20:51:06,792 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 20:51:06,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:06,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 20:51:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 785. [2020-02-10 20:51:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:51:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3120 transitions. [2020-02-10 20:51:06,815 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3120 transitions. Word has length 25 [2020-02-10 20:51:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:06,816 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3120 transitions. [2020-02-10 20:51:06,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3120 transitions. [2020-02-10 20:51:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:06,817 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:06,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-02-10 20:51:06,817 INFO L427 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-02-10 20:51:06,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:06,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1977854047, now seen corresponding path program 1086 times [2020-02-10 20:51:06,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:06,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178120483] [2020-02-10 20:51:06,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:07,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178120483] [2020-02-10 20:51:07,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:07,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:07,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315762618] [2020-02-10 20:51:07,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:07,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:07,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:07,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:07,197 INFO L87 Difference]: Start difference. First operand 785 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:51:07,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:07,333 INFO L93 Difference]: Finished difference Result 1254 states and 4393 transitions. [2020-02-10 20:51:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:07,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:07,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:07,337 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 20:51:07,337 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:51:07,337 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:07,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:51:07,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 775. [2020-02-10 20:51:07,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3098 transitions. [2020-02-10 20:51:07,360 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3098 transitions. Word has length 25 [2020-02-10 20:51:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:07,360 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3098 transitions. [2020-02-10 20:51:07,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3098 transitions. [2020-02-10 20:51:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:07,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:07,361 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:07,361 INFO L427 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-02-10 20:51:07,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:07,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1333239879, now seen corresponding path program 1087 times [2020-02-10 20:51:07,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:07,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061378492] [2020-02-10 20:51:07,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51: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-02-10 20:51:07,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061378492] [2020-02-10 20:51:07,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:07,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:07,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528600921] [2020-02-10 20:51:07,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:07,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:07,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:07,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:07,731 INFO L87 Difference]: Start difference. First operand 775 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:51:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:07,867 INFO L93 Difference]: Finished difference Result 1243 states and 4378 transitions. [2020-02-10 20:51:07,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:07,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:07,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:07,871 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:51:07,871 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 20:51:07,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-02-10 20:51:07,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 20:51:07,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-02-10 20:51:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:51:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3120 transitions. [2020-02-10 20:51:07,894 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3120 transitions. Word has length 25 [2020-02-10 20:51:07,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:07,894 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3120 transitions. [2020-02-10 20:51:07,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:07,895 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3120 transitions. [2020-02-10 20:51:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:07,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:07,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:07,896 INFO L427 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-02-10 20:51:07,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:07,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1991475803, now seen corresponding path program 1088 times [2020-02-10 20:51:07,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:07,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660168133] [2020-02-10 20:51:07,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:08,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660168133] [2020-02-10 20:51:08,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:08,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:08,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087239518] [2020-02-10 20:51:08,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:08,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:08,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:08,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:08,274 INFO L87 Difference]: Start difference. First operand 783 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:51:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:08,424 INFO L93 Difference]: Finished difference Result 1245 states and 4378 transitions. [2020-02-10 20:51:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:08,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:08,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:08,427 INFO L225 Difference]: With dead ends: 1245 [2020-02-10 20:51:08,428 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:51:08,428 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:51:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-02-10 20:51:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:51:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3109 transitions. [2020-02-10 20:51:08,450 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3109 transitions. Word has length 25 [2020-02-10 20:51:08,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:08,450 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3109 transitions. [2020-02-10 20:51:08,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3109 transitions. [2020-02-10 20:51:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:08,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:08,452 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:08,452 INFO L427 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-02-10 20:51:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:08,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1478592479, now seen corresponding path program 1089 times [2020-02-10 20:51:08,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:08,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776187008] [2020-02-10 20:51:08,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:08,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776187008] [2020-02-10 20:51:08,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:08,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:08,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637310273] [2020-02-10 20:51:08,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:08,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:08,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:08,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:08,828 INFO L87 Difference]: Start difference. First operand 779 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:51:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:08,964 INFO L93 Difference]: Finished difference Result 1242 states and 4372 transitions. [2020-02-10 20:51:08,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:08,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:08,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:08,968 INFO L225 Difference]: With dead ends: 1242 [2020-02-10 20:51:08,968 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 20:51:08,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:08,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 20:51:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 783. [2020-02-10 20:51:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:51:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-02-10 20:51:08,991 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-02-10 20:51:08,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:08,991 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-02-10 20:51:08,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-02-10 20:51:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:08,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:08,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:08,993 INFO L427 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-02-10 20:51:08,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:08,993 INFO L82 PathProgramCache]: Analyzing trace with hash -476831553, now seen corresponding path program 1090 times [2020-02-10 20:51:08,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:08,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874830942] [2020-02-10 20:51:08,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:09,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874830942] [2020-02-10 20:51:09,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:09,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:09,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801416063] [2020-02-10 20:51:09,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:09,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:09,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:09,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:09,375 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:51:09,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:09,531 INFO L93 Difference]: Finished difference Result 1243 states and 4370 transitions. [2020-02-10 20:51:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:09,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:09,535 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:51:09,535 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 20:51:09,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:09,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 20:51:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 779. [2020-02-10 20:51:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:51:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-02-10 20:51:09,558 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-02-10 20:51:09,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:09,558 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-02-10 20:51:09,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-02-10 20:51:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:09,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:09,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-02-10 20:51:09,559 INFO L427 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-02-10 20:51:09,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:09,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1001658169, now seen corresponding path program 1091 times [2020-02-10 20:51:09,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:09,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167866932] [2020-02-10 20:51:09,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:09,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167866932] [2020-02-10 20:51:09,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:09,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:09,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303156765] [2020-02-10 20:51:09,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:09,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:09,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:09,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:09,943 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:51:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:10,076 INFO L93 Difference]: Finished difference Result 1247 states and 4379 transitions. [2020-02-10 20:51:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:10,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:10,080 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 20:51:10,080 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:51:10,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:51:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 784. [2020-02-10 20:51:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:51:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3114 transitions. [2020-02-10 20:51:10,104 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3114 transitions. Word has length 25 [2020-02-10 20:51:10,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:10,104 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3114 transitions. [2020-02-10 20:51:10,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3114 transitions. [2020-02-10 20:51:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:10,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:10,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-02-10 20:51:10,105 INFO L427 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-02-10 20:51:10,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:10,105 INFO L82 PathProgramCache]: Analyzing trace with hash -463802591, now seen corresponding path program 1092 times [2020-02-10 20:51:10,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:10,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454451291] [2020-02-10 20:51:10,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:10,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454451291] [2020-02-10 20:51:10,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:10,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:10,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834706377] [2020-02-10 20:51:10,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:10,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:10,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:10,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:10,500 INFO L87 Difference]: Start difference. First operand 784 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:51:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:10,635 INFO L93 Difference]: Finished difference Result 1246 states and 4372 transitions. [2020-02-10 20:51:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:10,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:10,639 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:51:10,639 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 20:51:10,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 20:51:10,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 775. [2020-02-10 20:51:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-02-10 20:51:10,662 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-02-10 20:51:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:10,662 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-02-10 20:51:10,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-02-10 20:51:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:10,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:10,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:10,663 INFO L427 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-02-10 20:51:10,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash 45369287, now seen corresponding path program 1093 times [2020-02-10 20:51:10,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:10,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228598982] [2020-02-10 20:51:10,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:11,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228598982] [2020-02-10 20:51:11,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:11,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:11,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488275532] [2020-02-10 20:51:11,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:11,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:11,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:11,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:11,031 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:51:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:11,177 INFO L93 Difference]: Finished difference Result 1245 states and 4378 transitions. [2020-02-10 20:51:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:11,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:11,181 INFO L225 Difference]: With dead ends: 1245 [2020-02-10 20:51:11,181 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:51:11,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:51:11,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-02-10 20:51:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:51:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-02-10 20:51:11,205 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-02-10 20:51:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:11,205 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-02-10 20:51:11,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-02-10 20:51:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:11,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:11,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-02-10 20:51:11,206 INFO L427 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-02-10 20:51:11,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:11,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1036627109, now seen corresponding path program 1094 times [2020-02-10 20:51:11,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:11,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221312666] [2020-02-10 20:51:11,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:11,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221312666] [2020-02-10 20:51:11,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:11,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:11,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735773981] [2020-02-10 20:51:11,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:11,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:11,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:11,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:11,578 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:51:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:11,713 INFO L93 Difference]: Finished difference Result 1248 states and 4380 transitions. [2020-02-10 20:51:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:11,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:11,717 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 20:51:11,717 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:51:11,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:51:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 779. [2020-02-10 20:51:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:51:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-02-10 20:51:11,740 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-02-10 20:51:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:11,740 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-02-10 20:51:11,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-02-10 20:51:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:11,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:11,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-02-10 20:51:11,741 INFO L427 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-02-10 20:51:11,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:11,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1971403365, now seen corresponding path program 1095 times [2020-02-10 20:51:11,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:11,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827905247] [2020-02-10 20:51:11,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:12,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827905247] [2020-02-10 20:51:12,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:12,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:12,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524361557] [2020-02-10 20:51:12,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:12,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:12,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:12,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:12,131 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:51:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:12,264 INFO L93 Difference]: Finished difference Result 1243 states and 4370 transitions. [2020-02-10 20:51:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:12,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:12,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:12,268 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:51:12,268 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 20:51:12,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 20:51:12,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-02-10 20:51:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:51:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-02-10 20:51:12,292 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-02-10 20:51:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:12,292 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-02-10 20:51:12,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-02-10 20:51:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:12,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:12,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-02-10 20:51:12,293 INFO L427 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-02-10 20:51:12,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:12,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1321803005, now seen corresponding path program 1096 times [2020-02-10 20:51:12,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:12,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288929012] [2020-02-10 20:51:12,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:12,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:12,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288929012] [2020-02-10 20:51:12,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:12,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:12,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518714982] [2020-02-10 20:51:12,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:12,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:12,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:12,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:12,663 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:51:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:12,805 INFO L93 Difference]: Finished difference Result 1244 states and 4368 transitions. [2020-02-10 20:51:12,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:12,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:12,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:12,809 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:51:12,809 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:51:12,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:51:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-02-10 20:51:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:51:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3101 transitions. [2020-02-10 20:51:12,832 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3101 transitions. Word has length 25 [2020-02-10 20:51:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:12,832 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3101 transitions. [2020-02-10 20:51:12,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3101 transitions. [2020-02-10 20:51:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:12,833 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:12,833 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:12,834 INFO L427 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-02-10 20:51:12,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:12,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2026444743, now seen corresponding path program 1097 times [2020-02-10 20:51:12,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:12,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122140956] [2020-02-10 20:51:12,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:13,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-02-10 20:51:13,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122140956] [2020-02-10 20:51:13,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:13,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:13,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977695677] [2020-02-10 20:51:13,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:13,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:13,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:13,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:13,212 INFO L87 Difference]: Start difference. First operand 779 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:51:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:13,345 INFO L93 Difference]: Finished difference Result 1250 states and 4381 transitions. [2020-02-10 20:51:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:13,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:13,349 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:51:13,349 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 20:51:13,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-02-10 20:51:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 20:51:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 784. [2020-02-10 20:51:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:51:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3110 transitions. [2020-02-10 20:51:13,371 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3110 transitions. Word has length 25 [2020-02-10 20:51:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:13,372 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3110 transitions. [2020-02-10 20:51:13,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3110 transitions. [2020-02-10 20:51:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:13,373 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:13,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-02-10 20:51:13,373 INFO L427 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-02-10 20:51:13,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:13,373 INFO L82 PathProgramCache]: Analyzing trace with hash -657581595, now seen corresponding path program 1098 times [2020-02-10 20:51:13,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:13,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204230689] [2020-02-10 20:51:13,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:13,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204230689] [2020-02-10 20:51:13,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:13,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:13,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155171187] [2020-02-10 20:51:13,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:13,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:13,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:13,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:13,752 INFO L87 Difference]: Start difference. First operand 784 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:51:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:13,894 INFO L93 Difference]: Finished difference Result 1248 states and 4372 transitions. [2020-02-10 20:51:13,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:13,895 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:13,898 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 20:51:13,898 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 20:51:13,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-02-10 20:51:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 20:51:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 775. [2020-02-10 20:51:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3090 transitions. [2020-02-10 20:51:13,921 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3090 transitions. Word has length 25 [2020-02-10 20:51:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:13,922 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3090 transitions. [2020-02-10 20:51:13,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3090 transitions. [2020-02-10 20:51:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:13,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:13,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-02-10 20:51:13,923 INFO L427 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-02-10 20:51:13,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:13,923 INFO L82 PathProgramCache]: Analyzing trace with hash -285193085, now seen corresponding path program 1099 times [2020-02-10 20:51:13,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:13,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055801114] [2020-02-10 20:51:13,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:14,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055801114] [2020-02-10 20:51:14,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:14,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:14,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572723012] [2020-02-10 20:51:14,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:14,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:14,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:14,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:14,306 INFO L87 Difference]: Start difference. First operand 775 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:51:14,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:14,441 INFO L93 Difference]: Finished difference Result 1257 states and 4405 transitions. [2020-02-10 20:51:14,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:14,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:14,445 INFO L225 Difference]: With dead ends: 1257 [2020-02-10 20:51:14,446 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 20:51:14,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-02-10 20:51:14,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 20:51:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 786. [2020-02-10 20:51:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:51:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3120 transitions. [2020-02-10 20:51:14,471 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3120 transitions. Word has length 25 [2020-02-10 20:51:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:14,471 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3120 transitions. [2020-02-10 20:51:14,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3120 transitions. [2020-02-10 20:51:14,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:14,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:14,472 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:14,472 INFO L427 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-02-10 20:51:14,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:14,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1358278465, now seen corresponding path program 1100 times [2020-02-10 20:51:14,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:14,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006598538] [2020-02-10 20:51:14,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:14,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006598538] [2020-02-10 20:51:14,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:14,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:14,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478417914] [2020-02-10 20:51:14,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:14,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:14,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:14,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:14,856 INFO L87 Difference]: Start difference. First operand 786 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:51:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:14,989 INFO L93 Difference]: Finished difference Result 1258 states and 4401 transitions. [2020-02-10 20:51:14,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:14,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:14,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:14,992 INFO L225 Difference]: With dead ends: 1258 [2020-02-10 20:51:14,993 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 20:51:14,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 20:51:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 780. [2020-02-10 20:51:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:51:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3104 transitions. [2020-02-10 20:51:15,015 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3104 transitions. Word has length 25 [2020-02-10 20:51:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:15,016 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3104 transitions. [2020-02-10 20:51:15,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3104 transitions. [2020-02-10 20:51:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:15,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:15,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-02-10 20:51:15,017 INFO L427 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-02-10 20:51:15,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:15,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1885630939, now seen corresponding path program 1101 times [2020-02-10 20:51:15,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:15,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659091556] [2020-02-10 20:51:15,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:15,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659091556] [2020-02-10 20:51:15,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:15,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:15,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957413683] [2020-02-10 20:51:15,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:15,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:15,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:15,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:15,401 INFO L87 Difference]: Start difference. First operand 780 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:51:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:15,535 INFO L93 Difference]: Finished difference Result 1254 states and 4393 transitions. [2020-02-10 20:51:15,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:15,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:15,539 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 20:51:15,539 INFO L226 Difference]: Without dead ends: 1239 [2020-02-10 20:51:15,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-02-10 20:51:15,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2020-02-10 20:51:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 785. [2020-02-10 20:51:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:51:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3113 transitions. [2020-02-10 20:51:15,562 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3113 transitions. Word has length 25 [2020-02-10 20:51:15,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:15,562 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3113 transitions. [2020-02-10 20:51:15,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3113 transitions. [2020-02-10 20:51:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:15,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:15,563 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:15,563 INFO L427 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-02-10 20:51:15,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:15,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1347775361, now seen corresponding path program 1102 times [2020-02-10 20:51:15,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:15,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198530886] [2020-02-10 20:51:15,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:15,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198530886] [2020-02-10 20:51:15,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:15,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:15,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150171042] [2020-02-10 20:51:15,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:15,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:15,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:15,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:15,962 INFO L87 Difference]: Start difference. First operand 785 states and 3113 transitions. Second operand 10 states. [2020-02-10 20:51:16,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:16,097 INFO L93 Difference]: Finished difference Result 1253 states and 4386 transitions. [2020-02-10 20:51:16,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:16,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:16,101 INFO L225 Difference]: With dead ends: 1253 [2020-02-10 20:51:16,101 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 20:51:16,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 20:51:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 780. [2020-02-10 20:51:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:51:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3099 transitions. [2020-02-10 20:51:16,123 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3099 transitions. Word has length 25 [2020-02-10 20:51:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:16,124 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3099 transitions. [2020-02-10 20:51:16,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3099 transitions. [2020-02-10 20:51:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:16,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:16,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-02-10 20:51:16,125 INFO L427 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-02-10 20:51:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1864624731, now seen corresponding path program 1103 times [2020-02-10 20:51:16,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:16,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655642873] [2020-02-10 20:51:16,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:16,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655642873] [2020-02-10 20:51:16,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:16,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:16,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030153228] [2020-02-10 20:51:16,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:16,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:16,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:16,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:16,500 INFO L87 Difference]: Start difference. First operand 780 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:51:16,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:16,632 INFO L93 Difference]: Finished difference Result 1256 states and 4392 transitions. [2020-02-10 20:51:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:16,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:16,636 INFO L225 Difference]: With dead ends: 1256 [2020-02-10 20:51:16,636 INFO L226 Difference]: Without dead ends: 1240 [2020-02-10 20:51:16,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2020-02-10 20:51:16,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 785. [2020-02-10 20:51:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:51:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3108 transitions. [2020-02-10 20:51:16,659 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3108 transitions. Word has length 25 [2020-02-10 20:51:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:16,659 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3108 transitions. [2020-02-10 20:51:16,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3108 transitions. [2020-02-10 20:51:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:16,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:16,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:16,660 INFO L427 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-02-10 20:51:16,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:16,661 INFO L82 PathProgramCache]: Analyzing trace with hash -253683773, now seen corresponding path program 1104 times [2020-02-10 20:51:16,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:16,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044881643] [2020-02-10 20:51:16,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:17,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044881643] [2020-02-10 20:51:17,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:17,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:17,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924219752] [2020-02-10 20:51:17,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:17,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:17,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:17,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:17,040 INFO L87 Difference]: Start difference. First operand 785 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:51:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:17,180 INFO L93 Difference]: Finished difference Result 1254 states and 4383 transitions. [2020-02-10 20:51:17,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:17,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:17,184 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 20:51:17,184 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:51:17,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-02-10 20:51:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:51:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 771. [2020-02-10 20:51:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:51:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-02-10 20:51:17,208 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-02-10 20:51:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:17,208 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-02-10 20:51:17,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-02-10 20:51:17,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:17,209 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:17,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-02-10 20:51:17,209 INFO L427 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-02-10 20:51:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:17,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1331414369, now seen corresponding path program 1105 times [2020-02-10 20:51:17,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:17,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436531435] [2020-02-10 20:51:17,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:17,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436531435] [2020-02-10 20:51:17,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:17,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:17,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016210646] [2020-02-10 20:51:17,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:17,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:17,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:17,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:17,562 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-02-10 20:51:17,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:17,705 INFO L93 Difference]: Finished difference Result 1226 states and 4319 transitions. [2020-02-10 20:51:17,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:17,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:17,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:17,709 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:51:17,709 INFO L226 Difference]: Without dead ends: 1213 [2020-02-10 20:51:17,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-02-10 20:51:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2020-02-10 20:51:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 781. [2020-02-10 20:51:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:51:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3112 transitions. [2020-02-10 20:51:17,732 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3112 transitions. Word has length 25 [2020-02-10 20:51:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:17,732 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3112 transitions. [2020-02-10 20:51:17,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3112 transitions. [2020-02-10 20:51:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:17,734 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:17,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-02-10 20:51:17,734 INFO L427 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-02-10 20:51:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:17,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1993301313, now seen corresponding path program 1106 times [2020-02-10 20:51:17,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:17,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149652902] [2020-02-10 20:51:17,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:18,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149652902] [2020-02-10 20:51:18,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:18,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:18,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285966592] [2020-02-10 20:51:18,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:18,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:18,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:18,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:18,085 INFO L87 Difference]: Start difference. First operand 781 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:51:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:18,227 INFO L93 Difference]: Finished difference Result 1228 states and 4319 transitions. [2020-02-10 20:51:18,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:18,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:18,231 INFO L225 Difference]: With dead ends: 1228 [2020-02-10 20:51:18,231 INFO L226 Difference]: Without dead ends: 1209 [2020-02-10 20:51:18,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:18,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-02-10 20:51:18,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 777. [2020-02-10 20:51:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-02-10 20:51:18,254 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-02-10 20:51:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:18,254 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-02-10 20:51:18,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-02-10 20:51:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:18,256 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:18,256 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:18,256 INFO L427 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-02-10 20:51:18,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:18,256 INFO L82 PathProgramCache]: Analyzing trace with hash 888515229, now seen corresponding path program 1107 times [2020-02-10 20:51:18,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:18,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795114403] [2020-02-10 20:51:18,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:18,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795114403] [2020-02-10 20:51:18,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:18,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:18,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10597077] [2020-02-10 20:51:18,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:18,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:18,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:18,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:18,608 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:51:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:18,765 INFO L93 Difference]: Finished difference Result 1227 states and 4317 transitions. [2020-02-10 20:51:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:18,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:18,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:18,769 INFO L225 Difference]: With dead ends: 1227 [2020-02-10 20:51:18,769 INFO L226 Difference]: Without dead ends: 1214 [2020-02-10 20:51:18,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-02-10 20:51:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-02-10 20:51:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 781. [2020-02-10 20:51:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:51:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-02-10 20:51:18,792 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-02-10 20:51:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:18,792 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-02-10 20:51:18,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-02-10 20:51:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:18,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:18,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-02-10 20:51:18,794 INFO L427 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-02-10 20:51:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:18,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1879773051, now seen corresponding path program 1108 times [2020-02-10 20:51:18,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:18,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526787446] [2020-02-10 20:51:18,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:19,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526787446] [2020-02-10 20:51:19,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:19,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:19,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729635889] [2020-02-10 20:51:19,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:19,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:19,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:19,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:19,142 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:51:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:19,294 INFO L93 Difference]: Finished difference Result 1230 states and 4319 transitions. [2020-02-10 20:51:19,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:19,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:19,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:19,297 INFO L225 Difference]: With dead ends: 1230 [2020-02-10 20:51:19,297 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 20:51:19,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 20:51:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 777. [2020-02-10 20:51:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 20:51:19,320 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 20:51:19,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:19,320 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 20:51:19,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 20:51:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:19,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:19,321 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:19,321 INFO L427 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-02-10 20:51:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:19,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1329079903, now seen corresponding path program 1109 times [2020-02-10 20:51:19,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:19,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698410673] [2020-02-10 20:51:19,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:19,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698410673] [2020-02-10 20:51:19,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:19,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:19,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338281779] [2020-02-10 20:51:19,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:19,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:19,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:19,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:19,686 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:51:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:19,820 INFO L93 Difference]: Finished difference Result 1233 states and 4327 transitions. [2020-02-10 20:51:19,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:19,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:19,824 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 20:51:19,824 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 20:51:19,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-02-10 20:51:19,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 20:51:19,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 783. [2020-02-10 20:51:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:51:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3108 transitions. [2020-02-10 20:51:19,847 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3108 transitions. Word has length 25 [2020-02-10 20:51:19,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:19,847 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3108 transitions. [2020-02-10 20:51:19,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3108 transitions. [2020-02-10 20:51:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:19,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:19,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-02-10 20:51:19,849 INFO L427 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-02-10 20:51:19,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:19,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1892802013, now seen corresponding path program 1110 times [2020-02-10 20:51:19,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:19,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240715024] [2020-02-10 20:51:19,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:20,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240715024] [2020-02-10 20:51:20,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:20,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:20,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620837750] [2020-02-10 20:51:20,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:20,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:20,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:20,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:20,209 INFO L87 Difference]: Start difference. First operand 783 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:51:20,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:20,344 INFO L93 Difference]: Finished difference Result 1234 states and 4323 transitions. [2020-02-10 20:51:20,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:20,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:20,348 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 20:51:20,348 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 20:51:20,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-02-10 20:51:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 20:51:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 773. [2020-02-10 20:51:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:51:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 20:51:20,371 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 20:51:20,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:20,371 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 20:51:20,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 20:51:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:20,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:20,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-02-10 20:51:20,372 INFO L427 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-02-10 20:51:20,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:20,372 INFO L82 PathProgramCache]: Analyzing trace with hash 63957191, now seen corresponding path program 1111 times [2020-02-10 20:51:20,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:20,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451105166] [2020-02-10 20:51:20,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:20,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451105166] [2020-02-10 20:51:20,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:20,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:20,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566109033] [2020-02-10 20:51:20,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:20,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:20,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:20,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:20,712 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:51:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:20,868 INFO L93 Difference]: Finished difference Result 1213 states and 4281 transitions. [2020-02-10 20:51:20,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:20,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:20,872 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:51:20,872 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:51:20,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:20,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:51:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 779. [2020-02-10 20:51:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:51:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 20:51:20,895 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 20:51:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:20,895 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 20:51:20,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 20:51:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:20,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:20,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:20,896 INFO L427 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-02-10 20:51:20,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:20,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1034208805, now seen corresponding path program 1112 times [2020-02-10 20:51:20,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:20,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264140601] [2020-02-10 20:51:20,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:21,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-02-10 20:51:21,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264140601] [2020-02-10 20:51:21,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:21,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:21,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433209020] [2020-02-10 20:51:21,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:21,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:21,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:21,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:21,247 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:51:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:21,383 INFO L93 Difference]: Finished difference Result 1215 states and 4281 transitions. [2020-02-10 20:51:21,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:21,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:21,386 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:51:21,386 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:51:21,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:51:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-02-10 20:51:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:51:21,408 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:51:21,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:21,409 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:51:21,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:51:21,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:21,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:21,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-02-10 20:51:21,410 INFO L427 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-02-10 20:51:21,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:21,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1104192989, now seen corresponding path program 1113 times [2020-02-10 20:51:21,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:21,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444311182] [2020-02-10 20:51:21,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:21,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444311182] [2020-02-10 20:51:21,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:21,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:21,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64458768] [2020-02-10 20:51:21,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:21,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:21,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:21,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:21,754 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:51:21,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:21,898 INFO L93 Difference]: Finished difference Result 1207 states and 4265 transitions. [2020-02-10 20:51:21,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:21,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:21,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:21,902 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:51:21,902 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:51:21,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:21,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:51:21,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-02-10 20:51:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:51:21,925 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:51:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:21,925 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:51:21,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:51:21,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:21,926 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:21,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:21,927 INFO L427 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-02-10 20:51:21,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:21,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2126960123, now seen corresponding path program 1114 times [2020-02-10 20:51:21,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:21,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837638772] [2020-02-10 20:51:21,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:22,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837638772] [2020-02-10 20:51:22,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:22,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:22,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045889369] [2020-02-10 20:51:22,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:22,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:22,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:22,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:22,276 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:51:22,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:22,425 INFO L93 Difference]: Finished difference Result 1205 states and 4259 transitions. [2020-02-10 20:51:22,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:22,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:22,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:22,429 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:51:22,429 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:51:22,429 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:22,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:51:22,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-02-10 20:51:22,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:51:22,452 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:51:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:22,452 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:51:22,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:51:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:22,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:22,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-02-10 20:51:22,453 INFO L427 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-02-10 20:51:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:22,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1619748409, now seen corresponding path program 1115 times [2020-02-10 20:51:22,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:22,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063782580] [2020-02-10 20:51:22,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:22,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063782580] [2020-02-10 20:51:22,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:22,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:22,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969324976] [2020-02-10 20:51:22,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:22,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:22,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:22,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:22,798 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:51:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:22,941 INFO L93 Difference]: Finished difference Result 1211 states and 4271 transitions. [2020-02-10 20:51:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:22,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:22,945 INFO L225 Difference]: With dead ends: 1211 [2020-02-10 20:51:22,945 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:51:22,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:22,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:51:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-02-10 20:51:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:51:22,968 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:51:22,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:22,968 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:51:22,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:22,969 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:51:22,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:22,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:22,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-02-10 20:51:22,970 INFO L427 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-02-10 20:51:22,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:22,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2139989085, now seen corresponding path program 1116 times [2020-02-10 20:51:22,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:22,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761987123] [2020-02-10 20:51:22,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:23,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761987123] [2020-02-10 20:51:23,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:23,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:23,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148390106] [2020-02-10 20:51:23,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:23,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:23,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:23,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:23,323 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:51:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:23,476 INFO L93 Difference]: Finished difference Result 1207 states and 4261 transitions. [2020-02-10 20:51:23,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:23,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:23,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:23,480 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:51:23,480 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:51:23,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:23,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:51:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 773. [2020-02-10 20:51:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:51:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:51:23,504 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:51:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:23,504 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:51:23,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:51:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:23,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:23,505 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:23,505 INFO L427 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-02-10 20:51:23,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:23,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1223913401, now seen corresponding path program 1117 times [2020-02-10 20:51:23,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:23,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738337590] [2020-02-10 20:51:23,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:23,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738337590] [2020-02-10 20:51:23,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:23,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:23,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331521724] [2020-02-10 20:51:23,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:23,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:23,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:23,853 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:51:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:24,038 INFO L93 Difference]: Finished difference Result 1215 states and 4283 transitions. [2020-02-10 20:51:24,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:24,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:24,042 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:51:24,042 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:51:24,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:51:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 779. [2020-02-10 20:51:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:51:24,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 20:51:24,064 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 20:51:24,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:24,064 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 20:51:24,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 20:51:24,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:24,065 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:24,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-02-10 20:51:24,066 INFO L427 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-02-10 20:51:24,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:24,066 INFO L82 PathProgramCache]: Analyzing trace with hash -232655579, now seen corresponding path program 1118 times [2020-02-10 20:51:24,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:24,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785903791] [2020-02-10 20:51:24,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:24,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785903791] [2020-02-10 20:51:24,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:24,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:24,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691967155] [2020-02-10 20:51:24,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:24,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:24,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:24,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:24,409 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:51:24,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:24,594 INFO L93 Difference]: Finished difference Result 1218 states and 4285 transitions. [2020-02-10 20:51:24,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:24,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:24,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:24,597 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 20:51:24,597 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:51:24,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:24,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:51:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 775. [2020-02-10 20:51:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:51:24,620 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:51:24,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:24,620 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:51:24,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:51:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:24,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:24,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-02-10 20:51:24,621 INFO L427 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-02-10 20:51:24,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:24,621 INFO L82 PathProgramCache]: Analyzing trace with hash 259221537, now seen corresponding path program 1119 times [2020-02-10 20:51:24,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:24,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801686589] [2020-02-10 20:51:24,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:24,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801686589] [2020-02-10 20:51:24,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:24,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:24,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081483422] [2020-02-10 20:51:24,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:24,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:24,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:24,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:24,966 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:51:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:25,113 INFO L93 Difference]: Finished difference Result 1208 states and 4265 transitions. [2020-02-10 20:51:25,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:25,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:25,117 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:51:25,117 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 20:51:25,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:25,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 20:51:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 777. [2020-02-10 20:51:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:51:25,139 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:51:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:25,140 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:51:25,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:51:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:25,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:25,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-02-10 20:51:25,141 INFO L427 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-02-10 20:51:25,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:25,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1281988671, now seen corresponding path program 1120 times [2020-02-10 20:51:25,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:25,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961626193] [2020-02-10 20:51:25,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:25,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961626193] [2020-02-10 20:51:25,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:25,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:25,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977573994] [2020-02-10 20:51:25,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:25,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:25,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:25,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:25,493 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:51:25,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:25,651 INFO L93 Difference]: Finished difference Result 1206 states and 4259 transitions. [2020-02-10 20:51:25,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:25,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:25,655 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:51:25,655 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:51:25,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-02-10 20:51:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:51:25,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-02-10 20:51:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:51:25,678 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:51:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:25,679 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:51:25,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:51:25,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:25,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:25,680 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:25,680 INFO L427 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-02-10 20:51:25,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:25,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1408354503, now seen corresponding path program 1121 times [2020-02-10 20:51:25,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:25,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756018355] [2020-02-10 20:51:25,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:26,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756018355] [2020-02-10 20:51:26,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:26,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:26,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44458792] [2020-02-10 20:51:26,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:26,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:26,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:26,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:26,025 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:51:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:26,179 INFO L93 Difference]: Finished difference Result 1214 states and 4275 transitions. [2020-02-10 20:51:26,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:26,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:26,182 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:51:26,182 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:51:26,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:51:26,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-02-10 20:51:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:51:26,205 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:51:26,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:26,205 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:51:26,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:51:26,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:26,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:26,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-02-10 20:51:26,206 INFO L427 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-02-10 20:51:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1946210081, now seen corresponding path program 1122 times [2020-02-10 20:51:26,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:26,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990467152] [2020-02-10 20:51:26,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:26,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-02-10 20:51:26,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990467152] [2020-02-10 20:51:26,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:26,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:26,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280170326] [2020-02-10 20:51:26,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:26,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:26,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:26,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:26,556 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:51:26,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:26,744 INFO L93 Difference]: Finished difference Result 1209 states and 4263 transitions. [2020-02-10 20:51:26,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:26,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:26,748 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:51:26,748 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:51:26,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-02-10 20:51:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:51:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 773. [2020-02-10 20:51:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:51:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:51:26,771 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:51:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:26,771 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:51:26,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:51:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:26,772 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:26,772 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:26,773 INFO L427 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-02-10 20:51:26,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:26,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1997374913, now seen corresponding path program 1123 times [2020-02-10 20:51:26,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:26,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724306141] [2020-02-10 20:51:26,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:27,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724306141] [2020-02-10 20:51:27,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:27,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:27,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321653303] [2020-02-10 20:51:27,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:27,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:27,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:27,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:27,133 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:51:27,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:27,295 INFO L93 Difference]: Finished difference Result 1225 states and 4305 transitions. [2020-02-10 20:51:27,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:27,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:27,299 INFO L225 Difference]: With dead ends: 1225 [2020-02-10 20:51:27,299 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 20:51:27,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 20:51:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 781. [2020-02-10 20:51:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:51:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-02-10 20:51:27,322 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-02-10 20:51:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:27,322 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-02-10 20:51:27,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-02-10 20:51:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:27,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:27,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-02-10 20:51:27,323 INFO L427 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-02-10 20:51:27,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:27,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1224507003, now seen corresponding path program 1124 times [2020-02-10 20:51:27,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:27,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270304593] [2020-02-10 20:51:27,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:27,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270304593] [2020-02-10 20:51:27,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:27,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:27,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608893434] [2020-02-10 20:51:27,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:27,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:27,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:27,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:27,685 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:51:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:27,826 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-02-10 20:51:27,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:27,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:27,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:27,830 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:51:27,830 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:51:27,830 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:51:27,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 775. [2020-02-10 20:51:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:51:27,854 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:51:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:27,854 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:51:27,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:27,854 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:51:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:27,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:27,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-02-10 20:51:27,855 INFO L427 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-02-10 20:51:27,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:27,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1791246117, now seen corresponding path program 1125 times [2020-02-10 20:51:27,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:27,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853201734] [2020-02-10 20:51:27,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:28,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853201734] [2020-02-10 20:51:28,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:28,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:28,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862514426] [2020-02-10 20:51:28,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:28,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:28,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:28,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:28,191 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:51:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:28,372 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 20:51:28,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:28,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:28,376 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:51:28,376 INFO L226 Difference]: Without dead ends: 1201 [2020-02-10 20:51:28,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-02-10 20:51:28,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 777. [2020-02-10 20:51:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:28,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:51:28,399 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:51:28,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:28,399 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:51:28,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:28,399 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:51:28,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:28,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:28,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:28,400 INFO L427 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-02-10 20:51:28,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:28,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1256016315, now seen corresponding path program 1126 times [2020-02-10 20:51:28,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:28,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998539806] [2020-02-10 20:51:28,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:28,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998539806] [2020-02-10 20:51:28,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:28,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:28,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826429182] [2020-02-10 20:51:28,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:28,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:28,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:28,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:28,734 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:51:28,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:28,914 INFO L93 Difference]: Finished difference Result 1212 states and 4271 transitions. [2020-02-10 20:51:28,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:28,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:28,917 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:51:28,917 INFO L226 Difference]: Without dead ends: 1199 [2020-02-10 20:51:28,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-02-10 20:51:28,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 775. [2020-02-10 20:51:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:51:28,940 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:51:28,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:28,941 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:51:28,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:28,941 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:51:28,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:28,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:28,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-02-10 20:51:28,942 INFO L427 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-02-10 20:51:28,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:28,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1812252325, now seen corresponding path program 1127 times [2020-02-10 20:51:28,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:28,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745725700] [2020-02-10 20:51:28,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:29,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745725700] [2020-02-10 20:51:29,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:29,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:29,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283079916] [2020-02-10 20:51:29,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:29,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:29,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:29,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:29,294 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:51:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:29,456 INFO L93 Difference]: Finished difference Result 1218 states and 4283 transitions. [2020-02-10 20:51:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:29,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:29,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:29,460 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 20:51:29,460 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:51:29,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:51:29,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-02-10 20:51:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:51:29,483 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:51:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:29,483 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:51:29,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:51:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:29,484 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:29,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-02-10 20:51:29,484 INFO L427 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-02-10 20:51:29,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:29,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1944859393, now seen corresponding path program 1128 times [2020-02-10 20:51:29,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:29,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722095734] [2020-02-10 20:51:29,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:29,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722095734] [2020-02-10 20:51:29,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:29,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:29,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658451268] [2020-02-10 20:51:29,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:29,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:29,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:29,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:29,828 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:51:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:29,984 INFO L93 Difference]: Finished difference Result 1213 states and 4271 transitions. [2020-02-10 20:51:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:29,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:29,987 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:51:29,987 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:51:29,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:51:30,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 771. [2020-02-10 20:51:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:51:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-02-10 20:51:30,010 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-02-10 20:51:30,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:30,010 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-02-10 20:51:30,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:30,010 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-02-10 20:51:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:30,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:30,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-02-10 20:51:30,011 INFO L427 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-02-10 20:51:30,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:30,011 INFO L82 PathProgramCache]: Analyzing trace with hash 696773025, now seen corresponding path program 1129 times [2020-02-10 20:51:30,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:30,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913439998] [2020-02-10 20:51:30,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:30,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913439998] [2020-02-10 20:51:30,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:30,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:30,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407523291] [2020-02-10 20:51:30,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:30,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:30,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:30,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:30,374 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-02-10 20:51:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:30,522 INFO L93 Difference]: Finished difference Result 1220 states and 4303 transitions. [2020-02-10 20:51:30,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:30,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:30,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:30,525 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:51:30,525 INFO L226 Difference]: Without dead ends: 1207 [2020-02-10 20:51:30,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:30,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2020-02-10 20:51:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 781. [2020-02-10 20:51:30,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:51:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:51:30,547 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:51:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:30,548 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:51:30,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:51:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:30,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:30,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-02-10 20:51:30,549 INFO L427 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-02-10 20:51:30,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:30,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1667024639, now seen corresponding path program 1130 times [2020-02-10 20:51:30,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:30,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820655901] [2020-02-10 20:51:30,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:30,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820655901] [2020-02-10 20:51:30,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:30,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:30,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629243073] [2020-02-10 20:51:30,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:30,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:30,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:30,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:30,930 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:51:31,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:31,093 INFO L93 Difference]: Finished difference Result 1222 states and 4303 transitions. [2020-02-10 20:51:31,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:31,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:31,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:31,096 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 20:51:31,097 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 20:51:31,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-02-10 20:51:31,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 20:51:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 777. [2020-02-10 20:51:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3099 transitions. [2020-02-10 20:51:31,120 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3099 transitions. Word has length 25 [2020-02-10 20:51:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:31,120 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3099 transitions. [2020-02-10 20:51:31,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3099 transitions. [2020-02-10 20:51:31,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:31,121 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:31,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-02-10 20:51:31,121 INFO L427 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-02-10 20:51:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:31,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2115059333, now seen corresponding path program 1131 times [2020-02-10 20:51:31,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:31,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81830946] [2020-02-10 20:51:31,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:31,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81830946] [2020-02-10 20:51:31,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:31,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:31,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481339205] [2020-02-10 20:51:31,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:31,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:31,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:31,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:31,495 INFO L87 Difference]: Start difference. First operand 777 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:51:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:31,662 INFO L93 Difference]: Finished difference Result 1219 states and 4297 transitions. [2020-02-10 20:51:31,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:31,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:31,665 INFO L225 Difference]: With dead ends: 1219 [2020-02-10 20:51:31,666 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 20:51:31,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-02-10 20:51:31,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 20:51:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 781. [2020-02-10 20:51:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:51:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3106 transitions. [2020-02-10 20:51:31,689 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3106 transitions. Word has length 25 [2020-02-10 20:51:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:31,689 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3106 transitions. [2020-02-10 20:51:31,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3106 transitions. [2020-02-10 20:51:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:31,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:31,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-02-10 20:51:31,690 INFO L427 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-02-10 20:51:31,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:31,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1113298407, now seen corresponding path program 1132 times [2020-02-10 20:51:31,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:31,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196081752] [2020-02-10 20:51:31,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:32,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-02-10 20:51:32,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196081752] [2020-02-10 20:51:32,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:32,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:32,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095987370] [2020-02-10 20:51:32,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:32,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:32,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:32,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:32,067 INFO L87 Difference]: Start difference. First operand 781 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:51:32,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:32,211 INFO L93 Difference]: Finished difference Result 1220 states and 4295 transitions. [2020-02-10 20:51:32,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:32,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:32,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:32,215 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:51:32,215 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:51:32,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:32,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:51:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-02-10 20:51:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-02-10 20:51:32,238 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-02-10 20:51:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:32,238 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-02-10 20:51:32,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-02-10 20:51:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:32,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51: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-02-10 20:51:32,240 INFO L427 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-02-10 20:51:32,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:32,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1638125023, now seen corresponding path program 1133 times [2020-02-10 20:51:32,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:32,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087864470] [2020-02-10 20:51:32,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:32,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087864470] [2020-02-10 20:51:32,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:32,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:32,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392867449] [2020-02-10 20:51:32,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:32,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:32,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:32,613 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:51:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:32,755 INFO L93 Difference]: Finished difference Result 1224 states and 4304 transitions. [2020-02-10 20:51:32,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:32,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:32,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:32,759 INFO L225 Difference]: With dead ends: 1224 [2020-02-10 20:51:32,759 INFO L226 Difference]: Without dead ends: 1209 [2020-02-10 20:51:32,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-02-10 20:51:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 782. [2020-02-10 20:51:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:51:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3104 transitions. [2020-02-10 20:51:32,782 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3104 transitions. Word has length 25 [2020-02-10 20:51:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:32,782 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3104 transitions. [2020-02-10 20:51:32,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3104 transitions. [2020-02-10 20:51:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:32,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:32,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:32,784 INFO L427 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-02-10 20:51:32,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:32,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1100269445, now seen corresponding path program 1134 times [2020-02-10 20:51:32,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:32,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107105628] [2020-02-10 20:51:32,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:33,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107105628] [2020-02-10 20:51:33,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:33,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:33,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47677533] [2020-02-10 20:51:33,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:33,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:33,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:33,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:33,169 INFO L87 Difference]: Start difference. First operand 782 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:51:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:33,317 INFO L93 Difference]: Finished difference Result 1223 states and 4297 transitions. [2020-02-10 20:51:33,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:33,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:33,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:33,321 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 20:51:33,321 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:51:33,321 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:51:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 773. [2020-02-10 20:51:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:51:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:51:33,345 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:51:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:33,345 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:51:33,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:51:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:33,346 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:33,346 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:33,346 INFO L427 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-02-10 20:51:33,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:33,346 INFO L82 PathProgramCache]: Analyzing trace with hash -148198427, now seen corresponding path program 1135 times [2020-02-10 20:51:33,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:33,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185314389] [2020-02-10 20:51:33,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:33,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185314389] [2020-02-10 20:51:33,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:33,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:33,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715540819] [2020-02-10 20:51:33,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:33,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:33,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:33,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:33,707 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:51:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:33,852 INFO L93 Difference]: Finished difference Result 1210 states and 4272 transitions. [2020-02-10 20:51:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:33,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:33,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:33,856 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:51:33,856 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 20:51:33,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 20:51:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 779. [2020-02-10 20:51:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:51:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 20:51:33,879 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 20:51:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:33,879 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 20:51:33,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 20:51:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:33,880 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:33,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-02-10 20:51:33,880 INFO L427 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-02-10 20:51:33,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:33,881 INFO L82 PathProgramCache]: Analyzing trace with hash 822053187, now seen corresponding path program 1136 times [2020-02-10 20:51:33,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:33,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369397592] [2020-02-10 20:51:33,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:34,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369397592] [2020-02-10 20:51:34,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:34,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:34,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195835774] [2020-02-10 20:51:34,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:34,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:34,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:34,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:34,238 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:51:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:34,371 INFO L93 Difference]: Finished difference Result 1212 states and 4272 transitions. [2020-02-10 20:51:34,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:34,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:34,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:34,375 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:51:34,375 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:51:34,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:34,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:51:34,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-02-10 20:51:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:51:34,398 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:51:34,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:34,398 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:51:34,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:51:34,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:34,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:34,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-02-10 20:51:34,400 INFO L427 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-02-10 20:51:34,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:34,400 INFO L82 PathProgramCache]: Analyzing trace with hash 892037371, now seen corresponding path program 1137 times [2020-02-10 20:51:34,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:34,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735156220] [2020-02-10 20:51:34,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:34,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735156220] [2020-02-10 20:51:34,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:34,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:34,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201688739] [2020-02-10 20:51:34,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:34,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:34,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:34,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:34,767 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:51:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:34,911 INFO L93 Difference]: Finished difference Result 1204 states and 4256 transitions. [2020-02-10 20:51:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:34,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:34,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:34,914 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:51:34,914 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:51:34,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:34,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:51:34,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-02-10 20:51:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:51:34,938 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:51:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:34,938 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:51:34,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:51:34,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:34,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:34,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-02-10 20:51:34,939 INFO L427 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-02-10 20:51:34,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:34,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1914804505, now seen corresponding path program 1138 times [2020-02-10 20:51:34,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:34,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887715954] [2020-02-10 20:51:34,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:35,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887715954] [2020-02-10 20:51:35,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:35,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:35,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337175532] [2020-02-10 20:51:35,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:35,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:35,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:35,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:35,303 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:51:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:35,469 INFO L93 Difference]: Finished difference Result 1202 states and 4250 transitions. [2020-02-10 20:51:35,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:35,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:35,473 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:51:35,473 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 20:51:35,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 20:51:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 775. [2020-02-10 20:51:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:51:35,496 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:51:35,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:35,496 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:51:35,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:51:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:35,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:35,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:35,498 INFO L427 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-02-10 20:51:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1831904027, now seen corresponding path program 1139 times [2020-02-10 20:51:35,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:35,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195345129] [2020-02-10 20:51:35,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:35,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195345129] [2020-02-10 20:51:35,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:35,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:35,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025442247] [2020-02-10 20:51:35,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:35,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:35,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:35,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:35,866 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:51:36,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:36,028 INFO L93 Difference]: Finished difference Result 1208 states and 4262 transitions. [2020-02-10 20:51:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:36,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:36,032 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:51:36,032 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:51:36,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:51:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 20:51:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:51:36,056 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:51:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:36,056 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:51:36,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:51:36,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:36,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:36,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-02-10 20:51:36,057 INFO L427 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-02-10 20:51:36,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:36,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1927833467, now seen corresponding path program 1140 times [2020-02-10 20:51:36,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:36,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523300186] [2020-02-10 20:51:36,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:36,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523300186] [2020-02-10 20:51:36,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:36,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:36,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917960056] [2020-02-10 20:51:36,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:36,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:36,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:36,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:36,413 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:51:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:36,561 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-02-10 20:51:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:36,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:36,564 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:51:36,564 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 20:51:36,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:36,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 20:51:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 773. [2020-02-10 20:51:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:51:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:51:36,587 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:51:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:36,587 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:51:36,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:51:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:36,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:36,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-02-10 20:51:36,588 INFO L427 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-02-10 20:51:36,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:36,589 INFO L82 PathProgramCache]: Analyzing trace with hash 67479333, now seen corresponding path program 1141 times [2020-02-10 20:51:36,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:36,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998554593] [2020-02-10 20:51:36,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:36,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998554593] [2020-02-10 20:51:36,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:36,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:36,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59136113] [2020-02-10 20:51:36,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:36,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:36,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:36,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:36,958 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:51:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:37,098 INFO L93 Difference]: Finished difference Result 1208 states and 4266 transitions. [2020-02-10 20:51:37,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:37,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:37,101 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:51:37,102 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 20:51:37,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 20:51:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 779. [2020-02-10 20:51:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:51:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:51:37,124 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:51:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:37,124 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:51:37,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:51:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:37,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:37,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-02-10 20:51:37,126 INFO L427 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-02-10 20:51:37,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:37,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1069240259, now seen corresponding path program 1142 times [2020-02-10 20:51:37,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:37,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748427460] [2020-02-10 20:51:37,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:37,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748427460] [2020-02-10 20:51:37,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:37,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:37,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335557477] [2020-02-10 20:51:37,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:37,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:37,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:37,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:37,493 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:51:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:37,637 INFO L93 Difference]: Finished difference Result 1209 states and 4264 transitions. [2020-02-10 20:51:37,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:37,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:37,641 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:51:37,641 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:51:37,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-02-10 20:51:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:51:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 775. [2020-02-10 20:51:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:51:37,663 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:51:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:37,664 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:51:37,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:51:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:37,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:37,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:37,665 INFO L427 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-02-10 20:51:37,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:37,665 INFO L82 PathProgramCache]: Analyzing trace with hash -375419807, now seen corresponding path program 1143 times [2020-02-10 20:51:37,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:37,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466069224] [2020-02-10 20:51:37,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:38,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466069224] [2020-02-10 20:51:38,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:38,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:38,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670582732] [2020-02-10 20:51:38,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:38,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:38,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:38,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:38,032 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:51:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:38,163 INFO L93 Difference]: Finished difference Result 1203 states and 4252 transitions. [2020-02-10 20:51:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:38,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:38,167 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 20:51:38,167 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:51:38,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:51:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 20:51:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:51:38,189 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:51:38,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:38,189 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:51:38,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:38,189 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:51:38,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:38,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:38,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-02-10 20:51:38,190 INFO L427 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-02-10 20:51:38,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:38,191 INFO L82 PathProgramCache]: Analyzing trace with hash 647347327, now seen corresponding path program 1144 times [2020-02-10 20:51:38,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:38,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904484167] [2020-02-10 20:51:38,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:38,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904484167] [2020-02-10 20:51:38,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:38,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:38,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895659884] [2020-02-10 20:51:38,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:38,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:38,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:38,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:38,573 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:51:38,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:38,707 INFO L93 Difference]: Finished difference Result 1201 states and 4246 transitions. [2020-02-10 20:51:38,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:38,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:38,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:38,711 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 20:51:38,711 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:51:38,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-02-10 20:51:38,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:51:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 775. [2020-02-10 20:51:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:51:38,734 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:51:38,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:38,734 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:51:38,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:51:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:38,736 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:38,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:38,736 INFO L427 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-02-10 20:51:38,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:38,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1584716955, now seen corresponding path program 1145 times [2020-02-10 20:51:38,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:38,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830793945] [2020-02-10 20:51:38,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:39,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830793945] [2020-02-10 20:51:39,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:39,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:39,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933064371] [2020-02-10 20:51:39,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:39,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:39,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:39,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:39,109 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:51:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:39,254 INFO L93 Difference]: Finished difference Result 1205 states and 4254 transitions. [2020-02-10 20:51:39,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:39,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:39,258 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:51:39,258 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:51:39,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:39,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:51:39,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-02-10 20:51:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:51:39,281 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:51:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:39,281 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:51:39,281 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:51:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:39,282 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:39,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-02-10 20:51:39,282 INFO L427 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-02-10 20:51:39,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:39,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1637164961, now seen corresponding path program 1146 times [2020-02-10 20:51:39,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:39,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461784938] [2020-02-10 20:51:39,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:39,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461784938] [2020-02-10 20:51:39,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:39,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:39,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346258360] [2020-02-10 20:51:39,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:39,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:39,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:39,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:39,639 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:51:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:39,775 INFO L93 Difference]: Finished difference Result 1202 states and 4246 transitions. [2020-02-10 20:51:39,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:39,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:39,779 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:51:39,779 INFO L226 Difference]: Without dead ends: 1187 [2020-02-10 20:51:39,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:39,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-02-10 20:51:39,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 773. [2020-02-10 20:51:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:51:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:51:39,802 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:51:39,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:39,802 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:51:39,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:39,802 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:51:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:39,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:39,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:39,804 INFO L427 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-02-10 20:51:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:39,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1988547263, now seen corresponding path program 1147 times [2020-02-10 20:51:39,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:39,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066868456] [2020-02-10 20:51:39,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:40,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066868456] [2020-02-10 20:51:40,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:40,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:40,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787129457] [2020-02-10 20:51:40,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:40,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:40,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:40,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:40,168 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:51:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:40,318 INFO L93 Difference]: Finished difference Result 1216 states and 4282 transitions. [2020-02-10 20:51:40,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:40,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:40,321 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:51:40,322 INFO L226 Difference]: Without dead ends: 1201 [2020-02-10 20:51: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-02-10 20:51:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-02-10 20:51:40,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 780. [2020-02-10 20:51:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:51:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3098 transitions. [2020-02-10 20:51:40,345 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3098 transitions. Word has length 25 [2020-02-10 20:51:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:40,345 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3098 transitions. [2020-02-10 20:51:40,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3098 transitions. [2020-02-10 20:51:40,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:40,346 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:40,346 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:40,346 INFO L427 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-02-10 20:51:40,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:40,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1768564455, now seen corresponding path program 1148 times [2020-02-10 20:51:40,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:40,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328564777] [2020-02-10 20:51:40,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:40,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328564777] [2020-02-10 20:51:40,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:40,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:40,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569144848] [2020-02-10 20:51:40,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:40,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:40,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:40,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:40,714 INFO L87 Difference]: Start difference. First operand 780 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:51:40,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:40,869 INFO L93 Difference]: Finished difference Result 1215 states and 4275 transitions. [2020-02-10 20:51:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:40,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:40,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:40,873 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:51:40,873 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:51:40,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:51:40,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-02-10 20:51:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:51:40,895 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:51:40,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:40,895 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:51:40,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:51:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:40,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:40,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-02-10 20:51:40,897 INFO L427 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-02-10 20:51:40,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:40,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1212328445, now seen corresponding path program 1149 times [2020-02-10 20:51:40,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:40,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937155589] [2020-02-10 20:51:40,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:41,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937155589] [2020-02-10 20:51:41,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:41,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:41,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740849632] [2020-02-10 20:51:41,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:41,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:41,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:41,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:41,242 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:51:41,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:41,385 INFO L93 Difference]: Finished difference Result 1210 states and 4265 transitions. [2020-02-10 20:51:41,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:41,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:41,388 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:51:41,388 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 20:51:41,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:41,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 20:51:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 777. [2020-02-10 20:51:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:51:41,411 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:51:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:41,411 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:51:41,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:51:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:41,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:41,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-02-10 20:51:41,412 INFO L427 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-02-10 20:51:41,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:41,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1747558247, now seen corresponding path program 1150 times [2020-02-10 20:51:41,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:41,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326021864] [2020-02-10 20:51:41,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:41,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326021864] [2020-02-10 20:51:41,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:41,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:41,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479685554] [2020-02-10 20:51:41,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:41,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:41,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:41,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:41,767 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:51:41,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:41,917 INFO L93 Difference]: Finished difference Result 1206 states and 4255 transitions. [2020-02-10 20:51:41,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:41,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:41,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:41,920 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:51:41,920 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:51:41,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-02-10 20:51:41,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:51:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-02-10 20:51:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:51:41,942 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:51:41,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:41,943 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:51:41,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:51:41,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:41,944 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:41,944 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:41,944 INFO L427 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-02-10 20:51:41,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:41,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1180819133, now seen corresponding path program 1151 times [2020-02-10 20:51:41,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:41,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115614125] [2020-02-10 20:51:41,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:42,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115614125] [2020-02-10 20:51:42,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:42,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:42,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858770179] [2020-02-10 20:51:42,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:42,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:42,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:42,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:42,302 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:51:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:42,454 INFO L93 Difference]: Finished difference Result 1208 states and 4259 transitions. [2020-02-10 20:51:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:42,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:42,458 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:51:42,458 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:51:42,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:51:42,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-02-10 20:51:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:51:42,481 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:51:42,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:42,481 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:51:42,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:51:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:42,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:42,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:42,482 INFO L427 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-02-10 20:51:42,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2041062783, now seen corresponding path program 1152 times [2020-02-10 20:51:42,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:42,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620596628] [2020-02-10 20:51:42,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:42,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620596628] [2020-02-10 20:51:42,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:42,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:42,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233992870] [2020-02-10 20:51:42,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:42,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:42,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:42,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:42,840 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:51:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:42,975 INFO L93 Difference]: Finished difference Result 1205 states and 4251 transitions. [2020-02-10 20:51:42,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:42,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:42,979 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:51:42,979 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:51:42,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-02-10 20:51:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:51:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 771. [2020-02-10 20:51:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:51:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-02-10 20:51:43,002 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-02-10 20:51:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:43,002 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-02-10 20:51:43,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-02-10 20:51:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:43,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:43,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-02-10 20:51:43,004 INFO L427 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-02-10 20:51:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1015408803, now seen corresponding path program 1153 times [2020-02-10 20:51:43,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:43,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404696877] [2020-02-10 20:51:43,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51: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-02-10 20:51:43,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404696877] [2020-02-10 20:51:43,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:43,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:43,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316381977] [2020-02-10 20:51:43,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:43,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:43,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:43,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:43,361 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-02-10 20:51:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:43,501 INFO L93 Difference]: Finished difference Result 1223 states and 4307 transitions. [2020-02-10 20:51:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:43,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:43,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:43,505 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 20:51:43,505 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 20:51:43,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-02-10 20:51:43,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 20:51:43,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 781. [2020-02-10 20:51:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:51:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-02-10 20:51:43,528 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-02-10 20:51:43,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:43,529 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-02-10 20:51:43,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-02-10 20:51:43,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:43,530 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:43,530 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:43,530 INFO L427 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-02-10 20:51:43,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:43,530 INFO L82 PathProgramCache]: Analyzing trace with hash -24150981, now seen corresponding path program 1154 times [2020-02-10 20:51:43,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:43,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961642596] [2020-02-10 20:51:43,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:43,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961642596] [2020-02-10 20:51:43,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:43,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:43,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067889662] [2020-02-10 20:51:43,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:43,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:43,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:43,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:43,872 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:51:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:44,008 INFO L93 Difference]: Finished difference Result 1226 states and 4309 transitions. [2020-02-10 20:51:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:44,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:44,012 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:51:44,012 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 20:51:44,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 20:51:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 777. [2020-02-10 20:51:44,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 20:51:44,036 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 20:51:44,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:44,036 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 20:51:44,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 20:51:44,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:44,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:44,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-02-10 20:51:44,037 INFO L427 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-02-10 20:51:44,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:44,038 INFO L82 PathProgramCache]: Analyzing trace with hash 910625275, now seen corresponding path program 1155 times [2020-02-10 20:51:44,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:44,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939481181] [2020-02-10 20:51:44,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:44,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939481181] [2020-02-10 20:51:44,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:44,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:44,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3605680] [2020-02-10 20:51:44,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:44,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:44,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:44,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:44,385 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:51:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:44,517 INFO L93 Difference]: Finished difference Result 1221 states and 4299 transitions. [2020-02-10 20:51:44,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:44,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:44,521 INFO L225 Difference]: With dead ends: 1221 [2020-02-10 20:51:44,521 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 20:51:44,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:44,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 20:51:44,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 781. [2020-02-10 20:51:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:51:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 20:51:44,544 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 20:51:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:44,545 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 20:51:44,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 20:51:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:44,546 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:44,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-02-10 20:51:44,546 INFO L427 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-02-10 20:51:44,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:44,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1912386201, now seen corresponding path program 1156 times [2020-02-10 20:51:44,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:44,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568305888] [2020-02-10 20:51:44,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:44,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568305888] [2020-02-10 20:51:44,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:44,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:44,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754623247] [2020-02-10 20:51:44,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:44,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:44,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:44,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:44,898 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:51:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:45,039 INFO L93 Difference]: Finished difference Result 1222 states and 4297 transitions. [2020-02-10 20:51:45,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:45,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:45,042 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 20:51:45,042 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:51:45,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:45,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:51:45,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 777. [2020-02-10 20:51:45,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3093 transitions. [2020-02-10 20:51:45,066 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3093 transitions. Word has length 25 [2020-02-10 20:51:45,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:45,066 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3093 transitions. [2020-02-10 20:51:45,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3093 transitions. [2020-02-10 20:51:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:45,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:45,067 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:45,067 INFO L427 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-02-10 20:51:45,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:45,067 INFO L82 PathProgramCache]: Analyzing trace with hash 965666653, now seen corresponding path program 1157 times [2020-02-10 20:51:45,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:45,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201239969] [2020-02-10 20:51:45,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:45,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201239969] [2020-02-10 20:51:45,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:45,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:45,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951491682] [2020-02-10 20:51:45,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:45,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:45,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:45,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:45,426 INFO L87 Difference]: Start difference. First operand 777 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:51:45,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:45,564 INFO L93 Difference]: Finished difference Result 1228 states and 4310 transitions. [2020-02-10 20:51:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:45,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:45,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:45,567 INFO L225 Difference]: With dead ends: 1228 [2020-02-10 20:51:45,567 INFO L226 Difference]: Without dead ends: 1212 [2020-02-10 20:51:45,568 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-02-10 20:51:45,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 782. [2020-02-10 20:51:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:51:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3102 transitions. [2020-02-10 20:51:45,591 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3102 transitions. Word has length 25 [2020-02-10 20:51:45,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:45,591 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3102 transitions. [2020-02-10 20:51:45,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3102 transitions. [2020-02-10 20:51:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:45,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:45,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-02-10 20:51:45,592 INFO L427 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-02-10 20:51:45,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:45,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1718359685, now seen corresponding path program 1158 times [2020-02-10 20:51:45,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:45,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868571179] [2020-02-10 20:51:45,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:45,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868571179] [2020-02-10 20:51:45,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:45,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:45,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395748348] [2020-02-10 20:51:45,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:45,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:45,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:45,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:45,941 INFO L87 Difference]: Start difference. First operand 782 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:51:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:46,070 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-02-10 20:51:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:46,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:46,074 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:51:46,074 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 20:51:46,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:46,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 20:51:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 773. [2020-02-10 20:51:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:51:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:51:46,097 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:51:46,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:46,097 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:51:46,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:51:46,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:46,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:46,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-02-10 20:51:46,098 INFO L427 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-02-10 20:51:46,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:46,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1860380255, now seen corresponding path program 1159 times [2020-02-10 20:51:46,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:46,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841484628] [2020-02-10 20:51:46,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:46,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841484628] [2020-02-10 20:51:46,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:46,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:46,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468039751] [2020-02-10 20:51:46,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:46,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:46,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:46,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:46,457 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:51:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:46,588 INFO L93 Difference]: Finished difference Result 1213 states and 4276 transitions. [2020-02-10 20:51:46,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:46,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:46,591 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:51:46,592 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:51:46,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:46,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:51:46,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 779. [2020-02-10 20:51:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:51:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:51:46,614 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:51:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:46,614 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:51:46,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:51:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:46,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:46,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:46,616 INFO L427 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-02-10 20:51:46,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:46,616 INFO L82 PathProgramCache]: Analyzing trace with hash -869122433, now seen corresponding path program 1160 times [2020-02-10 20:51:46,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:46,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968276008] [2020-02-10 20:51:46,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:46,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968276008] [2020-02-10 20:51:46,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:46,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:46,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058255582] [2020-02-10 20:51:46,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:46,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:46,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:46,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:46,962 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:51:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:47,103 INFO L93 Difference]: Finished difference Result 1216 states and 4278 transitions. [2020-02-10 20:51:47,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:47,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:47,106 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:51:47,107 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:51:47,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:51:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-02-10 20:51:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:51:47,130 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:51:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:47,130 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:51:47,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:51:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:47,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:47,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-02-10 20:51:47,132 INFO L427 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-02-10 20:51:47,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:47,132 INFO L82 PathProgramCache]: Analyzing trace with hash -377245317, now seen corresponding path program 1161 times [2020-02-10 20:51:47,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:47,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516971041] [2020-02-10 20:51:47,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:47,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:47,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516971041] [2020-02-10 20:51:47,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:47,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:47,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219229889] [2020-02-10 20:51:47,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:47,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:47,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:47,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:47,474 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:51:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:47,625 INFO L93 Difference]: Finished difference Result 1206 states and 4258 transitions. [2020-02-10 20:51:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:47,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:47,628 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:51:47,628 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:51:47,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:51:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 20:51:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:51:47,651 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:51:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:47,651 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:51:47,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:51:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:47,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:47,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-02-10 20:51:47,653 INFO L427 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-02-10 20:51:47,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:47,653 INFO L82 PathProgramCache]: Analyzing trace with hash 645521817, now seen corresponding path program 1162 times [2020-02-10 20:51:47,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:47,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673324056] [2020-02-10 20:51:47,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:48,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673324056] [2020-02-10 20:51:48,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:48,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:48,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062135767] [2020-02-10 20:51:48,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:48,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:48,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:48,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:48,003 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:51:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:48,155 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-02-10 20:51:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:48,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:48,159 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:51:48,159 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:51:48,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:51:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 775. [2020-02-10 20:51:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:51:48,183 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:51:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:48,183 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:51:48,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:51:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:48,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:48,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-02-10 20:51:48,185 INFO L427 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-02-10 20:51:48,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:48,185 INFO L82 PathProgramCache]: Analyzing trace with hash 771887649, now seen corresponding path program 1163 times [2020-02-10 20:51:48,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:48,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887074388] [2020-02-10 20:51:48,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:48,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887074388] [2020-02-10 20:51:48,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:48,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:48,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055306227] [2020-02-10 20:51:48,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:48,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:48,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:48,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:48,530 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:51:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:48,702 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-02-10 20:51:48,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:48,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:48,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:48,706 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:51:48,706 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:51:48,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:48,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:51:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-02-10 20:51:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:51:48,730 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:51:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:48,730 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:51:48,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:51:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:48,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:48,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-02-10 20:51:48,731 INFO L427 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-02-10 20:51:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:48,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1309743227, now seen corresponding path program 1164 times [2020-02-10 20:51:48,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:48,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154989570] [2020-02-10 20:51:48,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:49,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-02-10 20:51:49,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154989570] [2020-02-10 20:51:49,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:49,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:49,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473380860] [2020-02-10 20:51:49,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:49,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:49,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:49,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:49,066 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:51:49,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:49,220 INFO L93 Difference]: Finished difference Result 1207 states and 4256 transitions. [2020-02-10 20:51:49,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:49,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:49,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:49,224 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:51:49,224 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:51:49,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:49,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:51:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 773. [2020-02-10 20:51:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:51:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:51:49,247 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:51:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:49,248 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:51:49,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:51:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:49,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:49,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-02-10 20:51:49,249 INFO L427 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-02-10 20:51:49,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:49,249 INFO L82 PathProgramCache]: Analyzing trace with hash -356831903, now seen corresponding path program 1165 times [2020-02-10 20:51:49,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:49,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255182963] [2020-02-10 20:51:49,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:49,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255182963] [2020-02-10 20:51:49,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:49,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:49,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430415060] [2020-02-10 20:51:49,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:49,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:49,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:49,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:49,597 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:51:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:49,740 INFO L93 Difference]: Finished difference Result 1209 states and 4266 transitions. [2020-02-10 20:51:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:49,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:49,743 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:51:49,743 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:51:49,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:51:49,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 779. [2020-02-10 20:51:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:51:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 20:51:49,766 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 20:51:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:49,766 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 20:51:49,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 20:51:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:49,767 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:49,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-02-10 20:51:49,767 INFO L427 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-02-10 20:51:49,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:49,767 INFO L82 PathProgramCache]: Analyzing trace with hash 644929023, now seen corresponding path program 1166 times [2020-02-10 20:51:49,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:49,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146694033] [2020-02-10 20:51:49,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:50,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146694033] [2020-02-10 20:51:50,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:50,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:50,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999831827] [2020-02-10 20:51:50,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:50,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:50,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:50,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:50,121 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:51:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:50,282 INFO L93 Difference]: Finished difference Result 1210 states and 4264 transitions. [2020-02-10 20:51:50,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:50,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:50,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:50,286 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:51:50,286 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:51:50,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:50,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:51:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-02-10 20:51:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:51:50,310 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:51:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:50,310 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:51:50,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:51:50,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:50,311 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:50,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-02-10 20:51:50,311 INFO L427 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-02-10 20:51:50,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:50,312 INFO L82 PathProgramCache]: Analyzing trace with hash -799731043, now seen corresponding path program 1167 times [2020-02-10 20:51:50,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:50,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924181752] [2020-02-10 20:51:50,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:50,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924181752] [2020-02-10 20:51:50,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:50,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:50,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992654704] [2020-02-10 20:51:50,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:50,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:50,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:50,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:50,656 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:51:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:50,796 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-02-10 20:51:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:50,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:50,800 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:51:50,800 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:51:50,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:50,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:51:50,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-02-10 20:51:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:51:50,824 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:51:50,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:50,824 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:51:50,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:51:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:50,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:50,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-02-10 20:51:50,825 INFO L427 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-02-10 20:51:50,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:50,826 INFO L82 PathProgramCache]: Analyzing trace with hash 223036091, now seen corresponding path program 1168 times [2020-02-10 20:51:50,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:50,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149216482] [2020-02-10 20:51:50,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:51,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-02-10 20:51:51,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149216482] [2020-02-10 20:51:51,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:51,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:51,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695305086] [2020-02-10 20:51:51,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:51,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:51,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:51,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:51,176 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:51:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:51,344 INFO L93 Difference]: Finished difference Result 1202 states and 4246 transitions. [2020-02-10 20:51:51,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:51,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:51,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:51,348 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:51:51,348 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 20:51:51,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-02-10 20:51:51,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 20:51:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 775. [2020-02-10 20:51:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:51:51,370 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:51:51,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:51,371 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:51:51,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:51,371 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:51:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:51,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:51,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-02-10 20:51:51,373 INFO L427 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-02-10 20:51:51,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:51,373 INFO L82 PathProgramCache]: Analyzing trace with hash -2009028191, now seen corresponding path program 1169 times [2020-02-10 20:51:51,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:51,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463323023] [2020-02-10 20:51:51,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:51,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463323023] [2020-02-10 20:51:51,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:51,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:51,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331934083] [2020-02-10 20:51:51,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:51,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:51,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:51,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:51,719 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:51:51,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:51,858 INFO L93 Difference]: Finished difference Result 1206 states and 4254 transitions. [2020-02-10 20:51:51,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:51,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:51,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:51,861 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:51:51,861 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:51:51,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:51:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 777. [2020-02-10 20:51:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:51:51,885 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:51:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:51,885 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:51:51,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:51:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:51,886 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:51,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-02-10 20:51:51,886 INFO L427 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-02-10 20:51:51,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:51,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1212853725, now seen corresponding path program 1170 times [2020-02-10 20:51:51,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:51,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604920090] [2020-02-10 20:51:51,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:52,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604920090] [2020-02-10 20:51:52,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:52,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:52,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193283681] [2020-02-10 20:51:52,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:52,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:52,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:52,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:52,234 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:51:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:52,405 INFO L93 Difference]: Finished difference Result 1203 states and 4246 transitions. [2020-02-10 20:51:52,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:52,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:52,408 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 20:51:52,408 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:51:52,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:52,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:51:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 773. [2020-02-10 20:51:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:51:52,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 20:51:52,430 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 20:51:52,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:52,431 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 20:51:52,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:52,431 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 20:51:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:52,432 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:52,432 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:52,432 INFO L427 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-02-10 20:51:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:52,432 INFO L82 PathProgramCache]: Analyzing trace with hash 297371643, now seen corresponding path program 1171 times [2020-02-10 20:51:52,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:52,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347070803] [2020-02-10 20:51:52,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:52,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347070803] [2020-02-10 20:51:52,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:52,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:52,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606349009] [2020-02-10 20:51:52,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:52,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:52,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:52,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:52,769 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 20:51:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:52,928 INFO L93 Difference]: Finished difference Result 1220 states and 4288 transitions. [2020-02-10 20:51:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:52,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:52,932 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:51:52,932 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:51:52,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:51:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 780. [2020-02-10 20:51:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:51:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3096 transitions. [2020-02-10 20:51:52,956 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3096 transitions. Word has length 25 [2020-02-10 20:51:52,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:52,956 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3096 transitions. [2020-02-10 20:51:52,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3096 transitions. [2020-02-10 20:51:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:52,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:52,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-02-10 20:51:52,958 INFO L427 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-02-10 20:51:52,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:52,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1908312601, now seen corresponding path program 1172 times [2020-02-10 20:51:52,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:52,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566598241] [2020-02-10 20:51:52,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:53,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566598241] [2020-02-10 20:51:53,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:53,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:53,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664354837] [2020-02-10 20:51:53,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:53,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:53,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:53,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:53,294 INFO L87 Difference]: Start difference. First operand 780 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:51:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:53,455 INFO L93 Difference]: Finished difference Result 1218 states and 4279 transitions. [2020-02-10 20:51:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:53,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:53,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:53,459 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 20:51:53,459 INFO L226 Difference]: Without dead ends: 1199 [2020-02-10 20:51:53,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-02-10 20:51:53,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 775. [2020-02-10 20:51:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:51:53,481 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:51:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:53,481 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:51:53,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:51:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:53,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:53,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:53,482 INFO L427 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-02-10 20:51:53,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:53,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1391463231, now seen corresponding path program 1173 times [2020-02-10 20:51:53,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:53,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372258236] [2020-02-10 20:51:53,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:53,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372258236] [2020-02-10 20:51:53,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:53,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:53,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830210557] [2020-02-10 20:51:53,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:53,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:53,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:53,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:53,813 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:51:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:53,950 INFO L93 Difference]: Finished difference Result 1214 states and 4271 transitions. [2020-02-10 20:51:53,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:53,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:53,953 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:51:53,953 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:51:53,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:51:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-02-10 20:51:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:51:53,976 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:51:53,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:53,976 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:51:53,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:51:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:53,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:53,977 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:53,977 INFO L427 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-02-10 20:51:53,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:53,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1929318809, now seen corresponding path program 1174 times [2020-02-10 20:51:53,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:53,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783554513] [2020-02-10 20:51:53,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:54,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:54,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783554513] [2020-02-10 20:51:54,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:54,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:54,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332812072] [2020-02-10 20:51:54,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:54,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:54,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:54,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:54,312 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:51:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:54,474 INFO L93 Difference]: Finished difference Result 1209 states and 4259 transitions. [2020-02-10 20:51:54,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:54,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:54,478 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:51:54,478 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:51:54,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:54,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:51:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-02-10 20:51:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:51:54,502 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:51:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:54,502 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:51:54,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:51:54,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:54,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:54,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-02-10 20:51:54,503 INFO L427 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-02-10 20:51:54,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:54,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1401966335, now seen corresponding path program 1175 times [2020-02-10 20:51:54,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:54,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426604286] [2020-02-10 20:51:54,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:54,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426604286] [2020-02-10 20:51:54,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:54,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:54,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328417732] [2020-02-10 20:51:54,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:54,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:54,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:54,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:54,833 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:51:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:54,971 INFO L93 Difference]: Finished difference Result 1210 states and 4261 transitions. [2020-02-10 20:51:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:54,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:54,974 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:51:54,975 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:51:54,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:51:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-02-10 20:51:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:51:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:51:54,998 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:51:54,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:54,998 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:51:54,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:54,998 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:51:54,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:54,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:54,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-02-10 20:51:54,999 INFO L427 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-02-10 20:51:54,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:54,999 INFO L82 PathProgramCache]: Analyzing trace with hash 328880955, now seen corresponding path program 1176 times [2020-02-10 20:51:54,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:54,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211350613] [2020-02-10 20:51:55,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:55,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211350613] [2020-02-10 20:51:55,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:55,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:55,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32929160] [2020-02-10 20:51:55,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:55,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:55,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:55,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:55,334 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:51:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:55,523 INFO L93 Difference]: Finished difference Result 1207 states and 4253 transitions. [2020-02-10 20:51:55,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:55,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:55,526 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:51:55,527 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:51:55,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:55,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:51:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 771. [2020-02-10 20:51:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:51:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3075 transitions. [2020-02-10 20:51:55,549 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3075 transitions. Word has length 25 [2020-02-10 20:51:55,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:55,549 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3075 transitions. [2020-02-10 20:51:55,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:55,550 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3075 transitions. [2020-02-10 20:51:55,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:55,551 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51: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-02-10 20:51:55,551 INFO L427 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-02-10 20:51:55,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:55,551 INFO L82 PathProgramCache]: Analyzing trace with hash 472498085, now seen corresponding path program 1177 times [2020-02-10 20:51:55,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:55,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331105364] [2020-02-10 20:51:55,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:55,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331105364] [2020-02-10 20:51:55,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:55,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:55,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785470107] [2020-02-10 20:51:55,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:55,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:55,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:55,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:55,923 INFO L87 Difference]: Start difference. First operand 771 states and 3075 transitions. Second operand 10 states. [2020-02-10 20:51:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:56,052 INFO L93 Difference]: Finished difference Result 1241 states and 4353 transitions. [2020-02-10 20:51:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:56,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:56,056 INFO L225 Difference]: With dead ends: 1241 [2020-02-10 20:51:56,056 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:51:56,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:56,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:51:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 784. [2020-02-10 20:51:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:51:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3114 transitions. [2020-02-10 20:51:56,079 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3114 transitions. Word has length 25 [2020-02-10 20:51:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:56,079 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3114 transitions. [2020-02-10 20:51:56,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3114 transitions. [2020-02-10 20:51:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:56,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:56,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-02-10 20:51:56,081 INFO L427 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-02-10 20:51:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:56,081 INFO L82 PathProgramCache]: Analyzing trace with hash -600587295, now seen corresponding path program 1178 times [2020-02-10 20:51:56,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:56,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237447643] [2020-02-10 20:51:56,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:56,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237447643] [2020-02-10 20:51:56,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:56,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:56,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653766036] [2020-02-10 20:51:56,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:56,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:56,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:56,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:56,440 INFO L87 Difference]: Start difference. First operand 784 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:51:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:56,590 INFO L93 Difference]: Finished difference Result 1242 states and 4349 transitions. [2020-02-10 20:51:56,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:56,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:56,594 INFO L225 Difference]: With dead ends: 1242 [2020-02-10 20:51:56,594 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 20:51:56,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-02-10 20:51:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 20:51:56,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-02-10 20:51:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:51:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 20:51:56,617 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 20:51:56,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:56,617 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 20:51:56,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 20:51:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:56,618 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:56,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:56,618 INFO L427 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-02-10 20:51:56,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:56,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1127939769, now seen corresponding path program 1179 times [2020-02-10 20:51:56,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:56,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43210176] [2020-02-10 20:51:56,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:56,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43210176] [2020-02-10 20:51:56,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:56,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:56,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673516919] [2020-02-10 20:51:56,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:56,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:56,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:56,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:56,991 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:51:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:57,126 INFO L93 Difference]: Finished difference Result 1238 states and 4341 transitions. [2020-02-10 20:51:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:57,126 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:57,130 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:51:57,130 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 20:51:57,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 20:51:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 783. [2020-02-10 20:51:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:51:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3107 transitions. [2020-02-10 20:51:57,153 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3107 transitions. Word has length 25 [2020-02-10 20:51:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:57,153 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3107 transitions. [2020-02-10 20:51:57,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:57,154 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3107 transitions. [2020-02-10 20:51:57,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:57,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:57,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-02-10 20:51:57,155 INFO L427 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-02-10 20:51:57,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:57,155 INFO L82 PathProgramCache]: Analyzing trace with hash -590084191, now seen corresponding path program 1180 times [2020-02-10 20:51:57,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:57,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186840403] [2020-02-10 20:51:57,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:57,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186840403] [2020-02-10 20:51:57,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:57,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:57,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995069895] [2020-02-10 20:51:57,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:57,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:57,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:57,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:57,523 INFO L87 Difference]: Start difference. First operand 783 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:51:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:57,663 INFO L93 Difference]: Finished difference Result 1237 states and 4334 transitions. [2020-02-10 20:51:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:57,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:57,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:57,667 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 20:51:57,667 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 20:51:57,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-02-10 20:51:57,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 20:51:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-02-10 20:51:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:51:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3093 transitions. [2020-02-10 20:51:57,691 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3093 transitions. Word has length 25 [2020-02-10 20:51:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:57,691 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3093 transitions. [2020-02-10 20:51:57,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3093 transitions. [2020-02-10 20:51:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:57,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:57,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-02-10 20:51:57,692 INFO L427 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-02-10 20:51:57,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:57,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1106933561, now seen corresponding path program 1181 times [2020-02-10 20:51:57,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:57,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159478325] [2020-02-10 20:51:57,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:58,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159478325] [2020-02-10 20:51:58,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:58,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:58,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982045460] [2020-02-10 20:51:58,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:58,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:58,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:58,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:58,056 INFO L87 Difference]: Start difference. First operand 778 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:51:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:58,218 INFO L93 Difference]: Finished difference Result 1240 states and 4340 transitions. [2020-02-10 20:51:58,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:58,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:58,222 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 20:51:58,222 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:51:58,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:58,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:51:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 783. [2020-02-10 20:51:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:51:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3102 transitions. [2020-02-10 20:51:58,245 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3102 transitions. Word has length 25 [2020-02-10 20:51:58,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:58,246 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3102 transitions. [2020-02-10 20:51:58,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3102 transitions. [2020-02-10 20:51:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:58,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:58,247 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:51:58,247 INFO L427 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-02-10 20:51:58,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:58,247 INFO L82 PathProgramCache]: Analyzing trace with hash 504007397, now seen corresponding path program 1182 times [2020-02-10 20:51:58,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:58,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885754888] [2020-02-10 20:51:58,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:58,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885754888] [2020-02-10 20:51:58,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:58,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:58,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173486249] [2020-02-10 20:51:58,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:58,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:58,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:58,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:58,612 INFO L87 Difference]: Start difference. First operand 783 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:51:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:58,769 INFO L93 Difference]: Finished difference Result 1238 states and 4331 transitions. [2020-02-10 20:51:58,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:58,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:58,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:58,773 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:51:58,773 INFO L226 Difference]: Without dead ends: 1214 [2020-02-10 20:51:58,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-02-10 20:51:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 773. [2020-02-10 20:51:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:51:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:51:58,796 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:51:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:58,796 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:51:58,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:51:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:58,798 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:58,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-02-10 20:51:58,798 INFO L427 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-02-10 20:51:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash 29598945, now seen corresponding path program 1183 times [2020-02-10 20:51:58,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:58,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425994267] [2020-02-10 20:51:58,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:59,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425994267] [2020-02-10 20:51:59,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:59,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:59,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98285690] [2020-02-10 20:51:59,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:59,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:59,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:59,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:59,158 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:51:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:59,303 INFO L93 Difference]: Finished difference Result 1229 states and 4315 transitions. [2020-02-10 20:51:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:59,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:59,307 INFO L225 Difference]: With dead ends: 1229 [2020-02-10 20:51:59,307 INFO L226 Difference]: Without dead ends: 1214 [2020-02-10 20:51:59,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:59,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-02-10 20:51:59,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 781. [2020-02-10 20:51:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:51:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3100 transitions. [2020-02-10 20:51:59,330 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3100 transitions. Word has length 25 [2020-02-10 20:51:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:59,331 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3100 transitions. [2020-02-10 20:51:59,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3100 transitions. [2020-02-10 20:51:59,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:59,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:59,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-02-10 20:51:59,332 INFO L427 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-02-10 20:51:59,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:59,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1043486435, now seen corresponding path program 1184 times [2020-02-10 20:51:59,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:59,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451303484] [2020-02-10 20:51:59,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:51:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:51:59,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451303484] [2020-02-10 20:51:59,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:51:59,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:51:59,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169415286] [2020-02-10 20:51:59,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:51:59,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:51:59,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:51:59,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:51:59,681 INFO L87 Difference]: Start difference. First operand 781 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:51:59,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:51:59,835 INFO L93 Difference]: Finished difference Result 1230 states and 4311 transitions. [2020-02-10 20:51:59,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:51:59,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:51:59,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:51:59,839 INFO L225 Difference]: With dead ends: 1230 [2020-02-10 20:51:59,839 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 20:51:59,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:51:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 20:51:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 775. [2020-02-10 20:51:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:51:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:51:59,863 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:51:59,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:51:59,863 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:51:59,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:51:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:51:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:51:59,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:51:59,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-02-10 20:51:59,864 INFO L427 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-02-10 20:51:59,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:51:59,864 INFO L82 PathProgramCache]: Analyzing trace with hash -476747321, now seen corresponding path program 1185 times [2020-02-10 20:51:59,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:51:59,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134236861] [2020-02-10 20:51:59,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:51:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:00,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134236861] [2020-02-10 20:52:00,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:00,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:00,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514001972] [2020-02-10 20:52:00,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:00,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:00,206 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:52:00,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:00,350 INFO L93 Difference]: Finished difference Result 1220 states and 4291 transitions. [2020-02-10 20:52:00,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:00,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:00,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:00,354 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:52:00,354 INFO L226 Difference]: Without dead ends: 1205 [2020-02-10 20:52:00,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:00,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-02-10 20:52:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 777. [2020-02-10 20:52:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:52:00,377 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:52:00,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:00,377 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:52:00,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:52:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:00,378 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:00,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-02-10 20:52:00,378 INFO L427 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-02-10 20:52:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:00,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1011977123, now seen corresponding path program 1186 times [2020-02-10 20:52:00,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:00,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939167956] [2020-02-10 20:52:00,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:00,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939167956] [2020-02-10 20:52:00,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:00,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:00,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442183905] [2020-02-10 20:52:00,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:00,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:00,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:00,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:00,724 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:52:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:00,866 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 20:52:00,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:00,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:00,869 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:52:00,869 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 20:52:00,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 20:52:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 775. [2020-02-10 20:52:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:52:00,892 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:52:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:00,892 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:52:00,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:52:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:00,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:00,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-02-10 20:52:00,893 INFO L427 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-02-10 20:52:00,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:00,893 INFO L82 PathProgramCache]: Analyzing trace with hash -455741113, now seen corresponding path program 1187 times [2020-02-10 20:52:00,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:00,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400000949] [2020-02-10 20:52:00,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:01,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400000949] [2020-02-10 20:52:01,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:01,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:01,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221714702] [2020-02-10 20:52:01,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:01,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:01,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:01,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:01,249 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:52:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:01,398 INFO L93 Difference]: Finished difference Result 1222 states and 4293 transitions. [2020-02-10 20:52:01,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:01,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:01,402 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 20:52:01,402 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 20:52:01,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-02-10 20:52:01,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 20:52:01,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 777. [2020-02-10 20:52:01,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:01,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:52:01,425 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:52:01,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:01,426 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:52:01,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:52:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:01,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:01,427 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:01,427 INFO L427 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-02-10 20:52:01,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:01,427 INFO L82 PathProgramCache]: Analyzing trace with hash 82114465, now seen corresponding path program 1188 times [2020-02-10 20:52:01,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:01,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080783206] [2020-02-10 20:52:01,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:01,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080783206] [2020-02-10 20:52:01,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:01,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:01,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473771654] [2020-02-10 20:52:01,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:01,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:01,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:01,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:01,782 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:52:01,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:01,937 INFO L93 Difference]: Finished difference Result 1217 states and 4281 transitions. [2020-02-10 20:52:01,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:01,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:01,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:01,941 INFO L225 Difference]: With dead ends: 1217 [2020-02-10 20:52:01,941 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:52:01,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-02-10 20:52:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:52:01,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 773. [2020-02-10 20:52:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:52:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 20:52:01,965 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 20:52:01,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:01,965 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 20:52:01,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 20:52:01,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:01,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:01,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-02-10 20:52:01,966 INFO L427 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-02-10 20:52:01,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:01,967 INFO L82 PathProgramCache]: Analyzing trace with hash 355195169, now seen corresponding path program 1189 times [2020-02-10 20:52:01,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:01,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278261271] [2020-02-10 20:52:01,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:02,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278261271] [2020-02-10 20:52:02,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:02,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:02,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735526911] [2020-02-10 20:52:02,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:02,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:02,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:02,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:02,341 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 20:52:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:02,502 INFO L93 Difference]: Finished difference Result 1223 states and 4299 transitions. [2020-02-10 20:52:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:02,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:02,506 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 20:52:02,506 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 20:52:02,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:02,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 20:52:02,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 780. [2020-02-10 20:52:02,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:52:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3096 transitions. [2020-02-10 20:52:02,529 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3096 transitions. Word has length 25 [2020-02-10 20:52:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:02,529 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3096 transitions. [2020-02-10 20:52:02,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3096 transitions. [2020-02-10 20:52:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:02,530 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:02,530 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:02,530 INFO L427 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-02-10 20:52:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash 893050747, now seen corresponding path program 1190 times [2020-02-10 20:52:02,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:02,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215155867] [2020-02-10 20:52:02,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:02,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215155867] [2020-02-10 20:52:02,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:02,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:02,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673830459] [2020-02-10 20:52:02,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:02,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:02,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:02,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:02,891 INFO L87 Difference]: Start difference. First operand 780 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:52:03,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:03,028 INFO L93 Difference]: Finished difference Result 1222 states and 4292 transitions. [2020-02-10 20:52:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:03,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:03,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:03,031 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 20:52:03,032 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 20:52:03,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 20:52:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 775. [2020-02-10 20:52:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:52:03,055 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:52:03,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:03,056 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:52:03,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:03,056 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:52:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:03,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:03,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-02-10 20:52:03,057 INFO L427 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-02-10 20:52:03,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:03,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1449286757, now seen corresponding path program 1191 times [2020-02-10 20:52:03,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:03,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393787359] [2020-02-10 20:52:03,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:03,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393787359] [2020-02-10 20:52:03,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:03,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:03,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490938899] [2020-02-10 20:52:03,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:03,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:03,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:03,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:03,397 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:52:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:03,532 INFO L93 Difference]: Finished difference Result 1217 states and 4282 transitions. [2020-02-10 20:52:03,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:03,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:03,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:03,535 INFO L225 Difference]: With dead ends: 1217 [2020-02-10 20:52:03,536 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:52:03,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:03,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:52:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-02-10 20:52:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:03,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:52:03,559 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:52:03,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:03,559 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:52:03,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:03,559 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:52:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:03,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:03,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-02-10 20:52:03,560 INFO L427 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-02-10 20:52:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:03,560 INFO L82 PathProgramCache]: Analyzing trace with hash 914056955, now seen corresponding path program 1192 times [2020-02-10 20:52:03,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:03,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634393370] [2020-02-10 20:52:03,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:03,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634393370] [2020-02-10 20:52:03,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:03,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:03,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607933677] [2020-02-10 20:52:03,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:03,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:03,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:03,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:03,909 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:52:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:04,054 INFO L93 Difference]: Finished difference Result 1213 states and 4272 transitions. [2020-02-10 20:52:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:04,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:04,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:04,058 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:52:04,058 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:52:04,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:04,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:52:04,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 775. [2020-02-10 20:52:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:52:04,081 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:52:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:04,082 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:52:04,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:52:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:04,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:04,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-02-10 20:52:04,083 INFO L427 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-02-10 20:52:04,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:04,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1480796069, now seen corresponding path program 1193 times [2020-02-10 20:52:04,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:04,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890248198] [2020-02-10 20:52:04,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:04,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890248198] [2020-02-10 20:52:04,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:04,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:04,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135847658] [2020-02-10 20:52:04,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:04,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:04,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:04,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:04,446 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:52:04,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:04,595 INFO L93 Difference]: Finished difference Result 1215 states and 4276 transitions. [2020-02-10 20:52:04,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:04,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:04,599 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:52:04,599 INFO L226 Difference]: Without dead ends: 1201 [2020-02-10 20:52:04,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-02-10 20:52:04,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 777. [2020-02-10 20:52:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:52:04,622 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:52:04,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:04,622 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:52:04,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:52:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:04,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:04,623 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:04,623 INFO L427 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-02-10 20:52:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:04,623 INFO L82 PathProgramCache]: Analyzing trace with hash 407710689, now seen corresponding path program 1194 times [2020-02-10 20:52:04,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:04,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894051879] [2020-02-10 20:52:04,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:04,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894051879] [2020-02-10 20:52:04,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:04,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:04,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519081256] [2020-02-10 20:52:04,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:04,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:04,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:04,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:04,976 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:52:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:05,128 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-02-10 20:52:05,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:05,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:05,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:05,132 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:52:05,132 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 20:52:05,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-02-10 20:52:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 20:52:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 773. [2020-02-10 20:52:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:52:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-02-10 20:52:05,156 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-02-10 20:52:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:05,156 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-02-10 20:52:05,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-02-10 20:52:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:05,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:05,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-02-10 20:52:05,157 INFO L427 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-02-10 20:52:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash -66697763, now seen corresponding path program 1195 times [2020-02-10 20:52:05,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:05,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474972399] [2020-02-10 20:52:05,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:05,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474972399] [2020-02-10 20:52:05,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:05,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:05,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681182946] [2020-02-10 20:52:05,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:05,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:05,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:05,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:05,511 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-02-10 20:52:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:05,674 INFO L93 Difference]: Finished difference Result 1226 states and 4303 transitions. [2020-02-10 20:52:05,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:05,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:05,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:05,678 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:52:05,678 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 20:52:05,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-02-10 20:52:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 20:52:05,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 780. [2020-02-10 20:52:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:52:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3094 transitions. [2020-02-10 20:52:05,701 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3094 transitions. Word has length 25 [2020-02-10 20:52:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:05,701 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3094 transitions. [2020-02-10 20:52:05,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3094 transitions. [2020-02-10 20:52:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:05,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:05,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:05,703 INFO L427 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-02-10 20:52:05,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:05,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1544243195, now seen corresponding path program 1196 times [2020-02-10 20:52:05,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:05,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281825786] [2020-02-10 20:52:05,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:06,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281825786] [2020-02-10 20:52:06,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:06,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:06,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208827632] [2020-02-10 20:52:06,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:06,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:06,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:06,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:06,063 INFO L87 Difference]: Start difference. First operand 780 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:52:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:06,219 INFO L93 Difference]: Finished difference Result 1224 states and 4294 transitions. [2020-02-10 20:52:06,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:06,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:06,222 INFO L225 Difference]: With dead ends: 1224 [2020-02-10 20:52:06,222 INFO L226 Difference]: Without dead ends: 1205 [2020-02-10 20:52:06,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:06,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-02-10 20:52:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 775. [2020-02-10 20:52:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:52:06,245 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:52:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:06,245 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:52:06,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:52:06,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:06,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:06,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-02-10 20:52:06,246 INFO L427 AbstractCegarLoop]: === Iteration 1204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:06,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:06,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1027393825, now seen corresponding path program 1197 times [2020-02-10 20:52:06,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:06,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669105305] [2020-02-10 20:52:06,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:06,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669105305] [2020-02-10 20:52:06,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:06,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:06,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611673465] [2020-02-10 20:52:06,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:06,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:06,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:06,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:06,586 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:52:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:06,750 INFO L93 Difference]: Finished difference Result 1220 states and 4286 transitions. [2020-02-10 20:52:06,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:06,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:06,754 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:52:06,754 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:52:06,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:06,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:52:06,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 777. [2020-02-10 20:52:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:52:06,777 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:52:06,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:06,777 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:52:06,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:06,777 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:52:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:06,778 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:06,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-02-10 20:52:06,778 INFO L427 AbstractCegarLoop]: === Iteration 1205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:06,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1565249403, now seen corresponding path program 1198 times [2020-02-10 20:52:06,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:06,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434636843] [2020-02-10 20:52:06,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:07,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434636843] [2020-02-10 20:52:07,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:07,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:07,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005277771] [2020-02-10 20:52:07,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:07,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:07,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:07,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:07,120 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:52:07,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:07,286 INFO L93 Difference]: Finished difference Result 1215 states and 4274 transitions. [2020-02-10 20:52:07,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:07,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:07,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:07,290 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:52:07,290 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:52:07,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:07,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:52:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 775. [2020-02-10 20:52:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-02-10 20:52:07,314 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-02-10 20:52:07,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:07,315 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-02-10 20:52:07,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:07,315 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-02-10 20:52:07,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:07,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:07,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:07,316 INFO L427 AbstractCegarLoop]: === Iteration 1206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:07,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1037896929, now seen corresponding path program 1199 times [2020-02-10 20:52:07,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:07,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787494301] [2020-02-10 20:52:07,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:07,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787494301] [2020-02-10 20:52:07,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:07,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:07,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414663680] [2020-02-10 20:52:07,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:07,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:07,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:07,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:07,668 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-02-10 20:52:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:07,803 INFO L93 Difference]: Finished difference Result 1216 states and 4276 transitions. [2020-02-10 20:52:07,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:07,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:07,806 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:52:07,807 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:52:07,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:52:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-02-10 20:52:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-02-10 20:52:07,830 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-02-10 20:52:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:07,830 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-02-10 20:52:07,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-02-10 20:52:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:07,831 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:07,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-02-10 20:52:07,831 INFO L427 AbstractCegarLoop]: === Iteration 1207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:07,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:07,831 INFO L82 PathProgramCache]: Analyzing trace with hash -35188451, now seen corresponding path program 1200 times [2020-02-10 20:52:07,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:07,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835370082] [2020-02-10 20:52:07,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:08,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835370082] [2020-02-10 20:52:08,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:08,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:08,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949272822] [2020-02-10 20:52:08,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:08,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:08,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:08,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:08,183 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:52:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:08,342 INFO L93 Difference]: Finished difference Result 1213 states and 4268 transitions. [2020-02-10 20:52:08,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:08,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:08,346 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:52:08,346 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:52:08,346 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:52:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 769. [2020-02-10 20:52:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 20:52:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3070 transitions. [2020-02-10 20:52:08,370 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3070 transitions. Word has length 25 [2020-02-10 20:52:08,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:08,370 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3070 transitions. [2020-02-10 20:52:08,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3070 transitions. [2020-02-10 20:52:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:08,371 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:08,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-02-10 20:52:08,371 INFO L427 AbstractCegarLoop]: === Iteration 1208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:08,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:08,371 INFO L82 PathProgramCache]: Analyzing trace with hash 765261477, now seen corresponding path program 1201 times [2020-02-10 20:52:08,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:08,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133592877] [2020-02-10 20:52:08,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:08,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133592877] [2020-02-10 20:52:08,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:08,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:08,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811281409] [2020-02-10 20:52:08,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:08,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:08,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:08,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:08,746 INFO L87 Difference]: Start difference. First operand 769 states and 3070 transitions. Second operand 10 states. [2020-02-10 20:52:08,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:08,911 INFO L93 Difference]: Finished difference Result 1206 states and 4266 transitions. [2020-02-10 20:52:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:08,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:08,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:08,914 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:52:08,914 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:52:08,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:08,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:52:08,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 780. [2020-02-10 20:52:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:52:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 20:52:08,937 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 20:52:08,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:08,937 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 20:52:08,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 20:52:08,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:08,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:08,939 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:08,939 INFO L427 AbstractCegarLoop]: === Iteration 1209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:08,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:08,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1746016195, now seen corresponding path program 1202 times [2020-02-10 20:52:08,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:08,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063585628] [2020-02-10 20:52:08,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:09,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063585628] [2020-02-10 20:52:09,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:09,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:09,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441140244] [2020-02-10 20:52:09,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:09,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:09,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:09,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:09,310 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:52:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:09,457 INFO L93 Difference]: Finished difference Result 1205 states and 4261 transitions. [2020-02-10 20:52:09,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:09,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:09,460 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:52:09,461 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:52:09,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:09,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:52:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 20:52:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3103 transitions. [2020-02-10 20:52:09,484 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3103 transitions. Word has length 25 [2020-02-10 20:52:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:09,484 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3103 transitions. [2020-02-10 20:52:09,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3103 transitions. [2020-02-10 20:52:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:09,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:09,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-02-10 20:52:09,485 INFO L427 AbstractCegarLoop]: === Iteration 1210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:09,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1603671741, now seen corresponding path program 1203 times [2020-02-10 20:52:09,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:09,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869608063] [2020-02-10 20:52:09,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:09,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869608063] [2020-02-10 20:52:09,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:09,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:09,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226001773] [2020-02-10 20:52:09,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:09,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:09,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:09,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:09,856 INFO L87 Difference]: Start difference. First operand 777 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:52:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:10,008 INFO L93 Difference]: Finished difference Result 1211 states and 4274 transitions. [2020-02-10 20:52:10,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:10,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:10,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:10,012 INFO L225 Difference]: With dead ends: 1211 [2020-02-10 20:52:10,012 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:52:10,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:52:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 781. [2020-02-10 20:52:10,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:52:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:52:10,035 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:52:10,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:10,035 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:52:10,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:52:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:10,036 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:10,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-02-10 20:52:10,036 INFO L427 AbstractCegarLoop]: === Iteration 1211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:10,036 INFO L82 PathProgramCache]: Analyzing trace with hash -612413919, now seen corresponding path program 1204 times [2020-02-10 20:52:10,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:10,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250452609] [2020-02-10 20:52:10,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:10,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250452609] [2020-02-10 20:52:10,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:10,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:10,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628348466] [2020-02-10 20:52:10,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:10,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:10,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:10,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:10,428 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:52:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:10,591 INFO L93 Difference]: Finished difference Result 1214 states and 4276 transitions. [2020-02-10 20:52:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:10,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:10,594 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:52:10,594 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:52:10,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-02-10 20:52:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:52:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-02-10 20:52:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 20:52:10,617 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 20:52:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:10,617 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 20:52:10,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 20:52:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:10,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:10,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-02-10 20:52:10,619 INFO L427 AbstractCegarLoop]: === Iteration 1212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:10,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1884729691, now seen corresponding path program 1205 times [2020-02-10 20:52:10,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:10,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954803368] [2020-02-10 20:52:10,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:10,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-02-10 20:52:10,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954803368] [2020-02-10 20:52:10,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:10,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:10,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66227779] [2020-02-10 20:52:10,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:10,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:10,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:10,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:10,977 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:52:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:11,115 INFO L93 Difference]: Finished difference Result 1208 states and 4264 transitions. [2020-02-10 20:52:11,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:11,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:11,119 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:52:11,119 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:52:11,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-02-10 20:52:11,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:52:11,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 780. [2020-02-10 20:52:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:52:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-02-10 20:52:11,142 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-02-10 20:52:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:11,142 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-02-10 20:52:11,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-02-10 20:52:11,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:11,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:11,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-02-10 20:52:11,143 INFO L427 AbstractCegarLoop]: === Iteration 1213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:11,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:11,143 INFO L82 PathProgramCache]: Analyzing trace with hash -273788733, now seen corresponding path program 1206 times [2020-02-10 20:52:11,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:11,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638939621] [2020-02-10 20:52:11,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:11,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:11,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638939621] [2020-02-10 20:52:11,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:11,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:11,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513168744] [2020-02-10 20:52:11,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:11,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:11,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:11,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:11,503 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:52:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:11,644 INFO L93 Difference]: Finished difference Result 1212 states and 4269 transitions. [2020-02-10 20:52:11,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:11,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:11,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:11,647 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:52:11,647 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:52:11,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-02-10 20:52:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:52:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 774. [2020-02-10 20:52:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:52:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3092 transitions. [2020-02-10 20:52:11,670 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3092 transitions. Word has length 25 [2020-02-10 20:52:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:11,671 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3092 transitions. [2020-02-10 20:52:11,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3092 transitions. [2020-02-10 20:52:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:11,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:11,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-02-10 20:52:11,672 INFO L427 AbstractCegarLoop]: === Iteration 1214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:11,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:11,672 INFO L82 PathProgramCache]: Analyzing trace with hash 342775751, now seen corresponding path program 1207 times [2020-02-10 20:52:11,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:11,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166225539] [2020-02-10 20:52:11,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:12,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166225539] [2020-02-10 20:52:12,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:12,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:12,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774750224] [2020-02-10 20:52:12,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:12,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:12,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:12,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:12,050 INFO L87 Difference]: Start difference. First operand 774 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:52:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:12,196 INFO L93 Difference]: Finished difference Result 1204 states and 4259 transitions. [2020-02-10 20:52:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:12,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:12,200 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:52:12,200 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:52:12,200 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:52:12,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 780. [2020-02-10 20:52:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:52:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3108 transitions. [2020-02-10 20:52:12,225 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3108 transitions. Word has length 25 [2020-02-10 20:52:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:12,225 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3108 transitions. [2020-02-10 20:52:12,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3108 transitions. [2020-02-10 20:52:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:12,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:12,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-02-10 20:52:12,226 INFO L427 AbstractCegarLoop]: === Iteration 1215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:12,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:12,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1323530469, now seen corresponding path program 1208 times [2020-02-10 20:52:12,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:12,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29331732] [2020-02-10 20:52:12,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:12,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29331732] [2020-02-10 20:52:12,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:12,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:12,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008013299] [2020-02-10 20:52:12,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:12,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:12,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:12,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:12,599 INFO L87 Difference]: Start difference. First operand 780 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:52:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:12,785 INFO L93 Difference]: Finished difference Result 1203 states and 4254 transitions. [2020-02-10 20:52:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:12,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:12,789 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 20:52:12,789 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:52:12,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:12,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:52:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 777. [2020-02-10 20:52:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 20:52:12,812 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 20:52:12,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:12,812 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 20:52:12,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 20:52:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:12,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:12,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-02-10 20:52:12,813 INFO L427 AbstractCegarLoop]: === Iteration 1216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:12,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:12,814 INFO L82 PathProgramCache]: Analyzing trace with hash -100123389, now seen corresponding path program 1209 times [2020-02-10 20:52:12,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:12,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838796253] [2020-02-10 20:52:12,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:13,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838796253] [2020-02-10 20:52:13,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:13,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:13,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887338547] [2020-02-10 20:52:13,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:13,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:13,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:13,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:13,196 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:52:13,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:13,377 INFO L93 Difference]: Finished difference Result 1207 states and 4263 transitions. [2020-02-10 20:52:13,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:13,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:13,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:13,381 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:52:13,381 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:52:13,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:52:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-02-10 20:52:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:52:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 20:52:13,404 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 20:52:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:13,404 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 20:52:13,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 20:52:13,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:13,405 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:13,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-02-10 20:52:13,405 INFO L427 AbstractCegarLoop]: === Iteration 1217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:13,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:13,406 INFO L82 PathProgramCache]: Analyzing trace with hash 901637537, now seen corresponding path program 1210 times [2020-02-10 20:52:13,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:13,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601096585] [2020-02-10 20:52:13,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:13,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601096585] [2020-02-10 20:52:13,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:13,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:13,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261153491] [2020-02-10 20:52:13,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:13,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:13,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:13,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:13,777 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:52:13,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:13,963 INFO L93 Difference]: Finished difference Result 1208 states and 4261 transitions. [2020-02-10 20:52:13,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:13,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:13,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:13,967 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:52:13,967 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:52:13,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:13,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:52:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 20:52:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 20:52:13,990 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 20:52:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:13,991 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 20:52:13,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 20:52:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:13,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:13,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:13,992 INFO L427 AbstractCegarLoop]: === Iteration 1218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:13,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:13,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1981619193, now seen corresponding path program 1211 times [2020-02-10 20:52:13,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:13,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206275255] [2020-02-10 20:52:13,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:14,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206275255] [2020-02-10 20:52:14,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:14,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:14,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508283937] [2020-02-10 20:52:14,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:14,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:14,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:14,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:14,384 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:52:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:14,546 INFO L93 Difference]: Finished difference Result 1204 states and 4253 transitions. [2020-02-10 20:52:14,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:14,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:14,550 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:52:14,550 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:52:14,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:52:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 780. [2020-02-10 20:52:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:52:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3102 transitions. [2020-02-10 20:52:14,574 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3102 transitions. Word has length 25 [2020-02-10 20:52:14,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:14,574 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3102 transitions. [2020-02-10 20:52:14,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3102 transitions. [2020-02-10 20:52:14,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:14,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:14,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-02-10 20:52:14,575 INFO L427 AbstractCegarLoop]: === Iteration 1219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:14,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:14,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1240262723, now seen corresponding path program 1212 times [2020-02-10 20:52:14,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:14,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783357227] [2020-02-10 20:52:14,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:14,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783357227] [2020-02-10 20:52:14,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:14,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:14,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115528092] [2020-02-10 20:52:14,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:14,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:14,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:14,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:14,947 INFO L87 Difference]: Start difference. First operand 780 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:52:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:15,132 INFO L93 Difference]: Finished difference Result 1206 states and 4254 transitions. [2020-02-10 20:52:15,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:15,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:15,136 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:52:15,136 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:52:15,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:15,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:52:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 774. [2020-02-10 20:52:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:52:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3089 transitions. [2020-02-10 20:52:15,159 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3089 transitions. Word has length 25 [2020-02-10 20:52:15,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:15,159 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3089 transitions. [2020-02-10 20:52:15,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:15,159 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3089 transitions. [2020-02-10 20:52:15,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:15,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:15,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-02-10 20:52:15,160 INFO L427 AbstractCegarLoop]: === Iteration 1220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:15,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:15,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1846324103, now seen corresponding path program 1213 times [2020-02-10 20:52:15,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:15,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859437711] [2020-02-10 20:52:15,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:15,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859437711] [2020-02-10 20:52:15,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:15,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:15,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393908801] [2020-02-10 20:52:15,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:15,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:15,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:15,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:15,525 INFO L87 Difference]: Start difference. First operand 774 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:52:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:15,706 INFO L93 Difference]: Finished difference Result 1217 states and 4288 transitions. [2020-02-10 20:52:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:15,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:15,710 INFO L225 Difference]: With dead ends: 1217 [2020-02-10 20:52:15,710 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:52:15,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:52:15,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 782. [2020-02-10 20:52:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:52:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3111 transitions. [2020-02-10 20:52:15,734 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3111 transitions. Word has length 25 [2020-02-10 20:52:15,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:15,734 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3111 transitions. [2020-02-10 20:52:15,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3111 transitions. [2020-02-10 20:52:15,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:15,735 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:15,735 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:15,735 INFO L427 AbstractCegarLoop]: === Iteration 1221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:15,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:15,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1457385371, now seen corresponding path program 1214 times [2020-02-10 20:52:15,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:15,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253129651] [2020-02-10 20:52:15,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:16,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253129651] [2020-02-10 20:52:16,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:16,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:16,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242778779] [2020-02-10 20:52:16,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:16,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:16,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:16,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:16,097 INFO L87 Difference]: Start difference. First operand 782 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:52:16,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:16,274 INFO L93 Difference]: Finished difference Result 1220 states and 4290 transitions. [2020-02-10 20:52:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:16,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:16,278 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:52:16,278 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:52:16,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-02-10 20:52:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:52:16,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 778. [2020-02-10 20:52:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:52:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-02-10 20:52:16,300 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-02-10 20:52:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:16,300 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-02-10 20:52:16,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-02-10 20:52:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:16,301 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:16,302 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:16,302 INFO L427 AbstractCegarLoop]: === Iteration 1222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:16,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:16,302 INFO L82 PathProgramCache]: Analyzing trace with hash -522609115, now seen corresponding path program 1215 times [2020-02-10 20:52:16,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:16,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852346145] [2020-02-10 20:52:16,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:16,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852346145] [2020-02-10 20:52:16,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:16,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:16,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627918111] [2020-02-10 20:52:16,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:16,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:16,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:16,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:16,665 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:52:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:16,803 INFO L93 Difference]: Finished difference Result 1215 states and 4280 transitions. [2020-02-10 20:52:16,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:16,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:16,807 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:52:16,807 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:52:16,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:52:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 782. [2020-02-10 20:52:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:52:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-02-10 20:52:16,831 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-02-10 20:52:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:16,831 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-02-10 20:52:16,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-02-10 20:52:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:16,832 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:16,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-02-10 20:52:16,832 INFO L427 AbstractCegarLoop]: === Iteration 1223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:16,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:16,832 INFO L82 PathProgramCache]: Analyzing trace with hash 479151811, now seen corresponding path program 1216 times [2020-02-10 20:52:16,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:16,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122785540] [2020-02-10 20:52:16,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:17,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122785540] [2020-02-10 20:52:17,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:17,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:17,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375816336] [2020-02-10 20:52:17,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:17,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:17,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:17,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:17,204 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:52:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:17,382 INFO L93 Difference]: Finished difference Result 1216 states and 4278 transitions. [2020-02-10 20:52:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:17,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:17,386 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:52:17,386 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:52:17,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-02-10 20:52:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:52:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 778. [2020-02-10 20:52:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:52:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 20:52:17,410 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 20:52:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:17,411 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 20:52:17,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 20:52:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:17,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:17,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-02-10 20:52:17,412 INFO L427 AbstractCegarLoop]: === Iteration 1224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:17,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:17,412 INFO L82 PathProgramCache]: Analyzing trace with hash -467567737, now seen corresponding path program 1217 times [2020-02-10 20:52:17,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:17,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351187093] [2020-02-10 20:52:17,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:17,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351187093] [2020-02-10 20:52:17,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:17,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:17,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268372123] [2020-02-10 20:52:17,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:17,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:17,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:17,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:17,776 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:52:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:17,959 INFO L93 Difference]: Finished difference Result 1222 states and 4291 transitions. [2020-02-10 20:52:17,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:17,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:17,963 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 20:52:17,963 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 20:52:17,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-02-10 20:52:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 20:52:17,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 783. [2020-02-10 20:52:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:52:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3105 transitions. [2020-02-10 20:52:17,987 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3105 transitions. Word has length 25 [2020-02-10 20:52:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:17,987 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3105 transitions. [2020-02-10 20:52:17,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3105 transitions. [2020-02-10 20:52:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:17,988 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:17,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-02-10 20:52:17,988 INFO L427 AbstractCegarLoop]: === Iteration 1225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:17,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:17,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1143373221, now seen corresponding path program 1218 times [2020-02-10 20:52:17,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:17,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439509314] [2020-02-10 20:52:17,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:18,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439509314] [2020-02-10 20:52:18,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:18,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:18,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079850873] [2020-02-10 20:52:18,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:18,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:18,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:18,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:18,353 INFO L87 Difference]: Start difference. First operand 783 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:52:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:18,542 INFO L93 Difference]: Finished difference Result 1220 states and 4282 transitions. [2020-02-10 20:52:18,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:18,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:18,545 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:52:18,545 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 20:52:18,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 20:52:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 774. [2020-02-10 20:52:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:52:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3086 transitions. [2020-02-10 20:52:18,582 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3086 transitions. Word has length 25 [2020-02-10 20:52:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:18,582 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3086 transitions. [2020-02-10 20:52:18,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3086 transitions. [2020-02-10 20:52:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:18,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:18,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:18,584 INFO L427 AbstractCegarLoop]: === Iteration 1226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:18,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1265154109, now seen corresponding path program 1219 times [2020-02-10 20:52:18,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:18,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578943788] [2020-02-10 20:52:18,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:18,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578943788] [2020-02-10 20:52:18,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:18,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:18,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294814599] [2020-02-10 20:52:18,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:18,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:18,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:18,944 INFO L87 Difference]: Start difference. First operand 774 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:52:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:19,128 INFO L93 Difference]: Finished difference Result 1210 states and 4266 transitions. [2020-02-10 20:52:19,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:19,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:19,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:19,131 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:52:19,131 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:52:19,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-02-10 20:52:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:52:19,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 780. [2020-02-10 20:52:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:52:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3102 transitions. [2020-02-10 20:52:19,154 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3102 transitions. Word has length 25 [2020-02-10 20:52:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:19,154 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3102 transitions. [2020-02-10 20:52:19,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3102 transitions. [2020-02-10 20:52:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:19,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:19,156 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:19,156 INFO L427 AbstractCegarLoop]: === Iteration 1227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:19,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:19,156 INFO L82 PathProgramCache]: Analyzing trace with hash 345786849, now seen corresponding path program 1220 times [2020-02-10 20:52:19,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:19,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348673363] [2020-02-10 20:52:19,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:19,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348673363] [2020-02-10 20:52:19,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:19,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:19,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106764104] [2020-02-10 20:52:19,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:19,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:19,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:19,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:19,512 INFO L87 Difference]: Start difference. First operand 780 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:52:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:19,657 INFO L93 Difference]: Finished difference Result 1214 states and 4271 transitions. [2020-02-10 20:52:19,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:19,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:19,660 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:52:19,661 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 20:52:19,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-02-10 20:52:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 20:52:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 777. [2020-02-10 20:52:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:52:19,683 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:52:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:19,683 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:52:19,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:52:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:19,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:19,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-02-10 20:52:19,684 INFO L427 AbstractCegarLoop]: === Iteration 1228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:19,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:19,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1429375333, now seen corresponding path program 1221 times [2020-02-10 20:52:19,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:19,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786813095] [2020-02-10 20:52:19,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:20,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786813095] [2020-02-10 20:52:20,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:20,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:20,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855244526] [2020-02-10 20:52:20,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:20,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:20,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:20,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:20,049 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:52:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:20,210 INFO L93 Difference]: Finished difference Result 1208 states and 4259 transitions. [2020-02-10 20:52:20,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:20,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:20,213 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:52:20,213 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:52:20,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:52:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 780. [2020-02-10 20:52:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:52:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3099 transitions. [2020-02-10 20:52:20,236 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3099 transitions. Word has length 25 [2020-02-10 20:52:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:20,236 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3099 transitions. [2020-02-10 20:52:20,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3099 transitions. [2020-02-10 20:52:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:20,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52: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-02-10 20:52:20,238 INFO L427 AbstractCegarLoop]: === Iteration 1229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:20,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:20,238 INFO L82 PathProgramCache]: Analyzing trace with hash 356289953, now seen corresponding path program 1222 times [2020-02-10 20:52:20,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:20,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58901025] [2020-02-10 20:52:20,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:20,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58901025] [2020-02-10 20:52:20,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:20,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:20,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382498630] [2020-02-10 20:52:20,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:20,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:20,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:20,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:20,593 INFO L87 Difference]: Start difference. First operand 780 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:52:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:20,774 INFO L93 Difference]: Finished difference Result 1210 states and 4260 transitions. [2020-02-10 20:52:20,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:20,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:20,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:20,777 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:52:20,778 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:52:20,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:52:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 20:52:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3091 transitions. [2020-02-10 20:52:20,800 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3091 transitions. Word has length 25 [2020-02-10 20:52:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:20,801 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3091 transitions. [2020-02-10 20:52:20,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3091 transitions. [2020-02-10 20:52:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:20,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:20,802 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:20,802 INFO L427 AbstractCegarLoop]: === Iteration 1230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:20,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:20,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1439878437, now seen corresponding path program 1223 times [2020-02-10 20:52:20,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:20,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155755372] [2020-02-10 20:52:20,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:21,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:21,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155755372] [2020-02-10 20:52:21,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:21,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:21,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709521635] [2020-02-10 20:52:21,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:21,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:21,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:21,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:21,160 INFO L87 Difference]: Start difference. First operand 777 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:52:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:21,304 INFO L93 Difference]: Finished difference Result 1218 states and 4278 transitions. [2020-02-10 20:52:21,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:21,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:21,308 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 20:52:21,308 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:52:21,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-02-10 20:52:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:52:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 782. [2020-02-10 20:52:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:52:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3100 transitions. [2020-02-10 20:52:21,331 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3100 transitions. Word has length 25 [2020-02-10 20:52:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:21,331 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3100 transitions. [2020-02-10 20:52:21,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3100 transitions. [2020-02-10 20:52:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:21,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:21,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-02-10 20:52:21,332 INFO L427 AbstractCegarLoop]: === Iteration 1231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:21,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1244147901, now seen corresponding path program 1224 times [2020-02-10 20:52:21,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:21,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097557321] [2020-02-10 20:52:21,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:21,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097557321] [2020-02-10 20:52:21,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:21,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:21,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901417728] [2020-02-10 20:52:21,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:21,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:21,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:21,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:21,689 INFO L87 Difference]: Start difference. First operand 782 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:52:21,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:21,869 INFO L93 Difference]: Finished difference Result 1216 states and 4269 transitions. [2020-02-10 20:52:21,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:21,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:21,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:21,872 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:52:21,873 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:52:21,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:21,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:52:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 771. [2020-02-10 20:52:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:52:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-02-10 20:52:21,896 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-02-10 20:52:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:21,896 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-02-10 20:52:21,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-02-10 20:52:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:21,897 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:21,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-02-10 20:52:21,897 INFO L427 AbstractCegarLoop]: === Iteration 1232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:21,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:21,897 INFO L82 PathProgramCache]: Analyzing trace with hash 340950241, now seen corresponding path program 1225 times [2020-02-10 20:52:21,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:21,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050081726] [2020-02-10 20:52:21,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:22,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050081726] [2020-02-10 20:52:22,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:22,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:22,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459139313] [2020-02-10 20:52:22,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:22,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:22,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:22,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:22,268 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-02-10 20:52:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:22,426 INFO L93 Difference]: Finished difference Result 1192 states and 4219 transitions. [2020-02-10 20:52:22,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:22,427 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:22,430 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:52:22,430 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:52:22,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:52:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 779. [2020-02-10 20:52:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:52:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 20:52:22,452 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 20:52:22,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:22,453 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 20:52:22,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 20:52:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:22,454 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:22,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-02-10 20:52:22,454 INFO L427 AbstractCegarLoop]: === Iteration 1233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:22,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:22,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1321704959, now seen corresponding path program 1226 times [2020-02-10 20:52:22,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:22,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335912214] [2020-02-10 20:52:22,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:22,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335912214] [2020-02-10 20:52:22,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:22,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:22,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700963400] [2020-02-10 20:52:22,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:22,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:22,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:22,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:22,843 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:52:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:23,027 INFO L93 Difference]: Finished difference Result 1191 states and 4214 transitions. [2020-02-10 20:52:23,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:23,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:23,031 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:52:23,031 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:52:23,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-02-10 20:52:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:52:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 776. [2020-02-10 20:52:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:52:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-02-10 20:52:23,054 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-02-10 20:52:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:23,055 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-02-10 20:52:23,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-02-10 20:52:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:23,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:23,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-02-10 20:52:23,056 INFO L427 AbstractCegarLoop]: === Iteration 1234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2027982977, now seen corresponding path program 1227 times [2020-02-10 20:52:23,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:23,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515013131] [2020-02-10 20:52:23,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:23,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515013131] [2020-02-10 20:52:23,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:23,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:23,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721007007] [2020-02-10 20:52:23,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:23,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:23,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:23,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:23,416 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:52:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:23,597 INFO L93 Difference]: Finished difference Result 1197 states and 4227 transitions. [2020-02-10 20:52:23,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:23,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:23,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:23,600 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 20:52:23,601 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:52:23,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-02-10 20:52:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:52:23,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 780. [2020-02-10 20:52:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:52:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-02-10 20:52:23,624 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-02-10 20:52:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:23,624 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-02-10 20:52:23,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-02-10 20:52:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:23,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:23,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:23,625 INFO L427 AbstractCegarLoop]: === Iteration 1235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1036725155, now seen corresponding path program 1228 times [2020-02-10 20:52:23,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:23,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536878022] [2020-02-10 20:52:23,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:23,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536878022] [2020-02-10 20:52:23,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:23,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:23,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166102763] [2020-02-10 20:52:23,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:23,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:23,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:23,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:23,986 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:52:24,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:24,176 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-02-10 20:52:24,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:24,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:24,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:24,179 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:52:24,179 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:52:24,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-02-10 20:52:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:52:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 776. [2020-02-10 20:52:24,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:52:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-02-10 20:52:24,202 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-02-10 20:52:24,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:24,202 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-02-10 20:52:24,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-02-10 20:52:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:24,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:24,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-02-10 20:52:24,203 INFO L427 AbstractCegarLoop]: === Iteration 1236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:24,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:24,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1985926369, now seen corresponding path program 1229 times [2020-02-10 20:52:24,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:24,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544331065] [2020-02-10 20:52:24,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:24,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544331065] [2020-02-10 20:52:24,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:24,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:24,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852660137] [2020-02-10 20:52:24,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:24,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:24,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:24,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:24,571 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:52:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:24,759 INFO L93 Difference]: Finished difference Result 1194 states and 4217 transitions. [2020-02-10 20:52:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:24,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:24,763 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:52:24,763 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:52:24,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:52:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 20:52:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:52:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:52:24,785 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:52:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:24,786 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:52:24,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:52:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:24,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:24,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-02-10 20:52:24,787 INFO L427 AbstractCegarLoop]: === Iteration 1237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:24,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash -698099969, now seen corresponding path program 1230 times [2020-02-10 20:52:24,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:24,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436101207] [2020-02-10 20:52:24,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:25,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436101207] [2020-02-10 20:52:25,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:25,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:25,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381448701] [2020-02-10 20:52:25,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:25,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:25,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:25,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:25,156 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:52:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:25,287 INFO L93 Difference]: Finished difference Result 1198 states and 4222 transitions. [2020-02-10 20:52:25,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:25,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:25,291 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 20:52:25,291 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:52:25,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:25,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:52:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 773. [2020-02-10 20:52:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:52:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:52:25,314 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:52:25,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:25,314 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:52:25,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:52:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:25,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:25,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:25,316 INFO L427 AbstractCegarLoop]: === Iteration 1238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:25,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:25,316 INFO L82 PathProgramCache]: Analyzing trace with hash -926506937, now seen corresponding path program 1231 times [2020-02-10 20:52:25,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:25,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677453420] [2020-02-10 20:52:25,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:25,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677453420] [2020-02-10 20:52:25,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:25,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:25,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077035563] [2020-02-10 20:52:25,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:25,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:25,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:25,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:25,700 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:52:25,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:25,831 INFO L93 Difference]: Finished difference Result 1183 states and 4194 transitions. [2020-02-10 20:52:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:25,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:25,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:25,835 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:52:25,835 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:52:25,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:52:25,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 778. [2020-02-10 20:52:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:52:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 20:52:25,858 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 20:52:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:25,858 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 20:52:25,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 20:52:25,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:25,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:25,859 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:25,860 INFO L427 AbstractCegarLoop]: === Iteration 1239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:25,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:25,860 INFO L82 PathProgramCache]: Analyzing trace with hash 54247781, now seen corresponding path program 1232 times [2020-02-10 20:52:25,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:25,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92428770] [2020-02-10 20:52:25,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:26,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92428770] [2020-02-10 20:52:26,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:26,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:26,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611012823] [2020-02-10 20:52:26,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:26,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:26,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:26,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:26,244 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:52:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:26,373 INFO L93 Difference]: Finished difference Result 1182 states and 4189 transitions. [2020-02-10 20:52:26,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:26,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:26,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:26,376 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:52:26,376 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:52:26,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:26,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:52:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-02-10 20:52:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:52:26,399 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:52:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:26,399 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:52:26,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:52:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:26,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:26,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:26,400 INFO L427 AbstractCegarLoop]: === Iteration 1240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:26,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:26,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1812305217, now seen corresponding path program 1233 times [2020-02-10 20:52:26,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:26,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236641118] [2020-02-10 20:52:26,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:26,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236641118] [2020-02-10 20:52:26,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:26,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:26,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889610038] [2020-02-10 20:52:26,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:26,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:26,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:26,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:26,771 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:52:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:26,914 INFO L93 Difference]: Finished difference Result 1181 states and 4187 transitions. [2020-02-10 20:52:26,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:26,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:26,917 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:52:26,918 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:52:26,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:52:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 20:52:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:52:26,955 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:52:26,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:26,955 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:52:26,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:52:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:26,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:26,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-02-10 20:52:26,956 INFO L427 AbstractCegarLoop]: === Iteration 1241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:26,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:26,957 INFO L82 PathProgramCache]: Analyzing trace with hash -789538083, now seen corresponding path program 1234 times [2020-02-10 20:52:26,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:26,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918934049] [2020-02-10 20:52:26,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:27,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918934049] [2020-02-10 20:52:27,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:27,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:27,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569152866] [2020-02-10 20:52:27,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:27,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:27,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:27,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:27,330 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:52:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:27,463 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-02-10 20:52:27,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:27,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:27,467 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:52:27,467 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:52:27,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-02-10 20:52:27,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:52:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-02-10 20:52:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:52:27,490 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:52:27,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:27,490 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:52:27,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:27,490 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:52:27,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:27,491 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:27,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-02-10 20:52:27,492 INFO L427 AbstractCegarLoop]: === Iteration 1242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:27,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:27,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1695257863, now seen corresponding path program 1235 times [2020-02-10 20:52:27,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:27,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069161296] [2020-02-10 20:52:27,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:27,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069161296] [2020-02-10 20:52:27,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:27,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:27,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500153653] [2020-02-10 20:52:27,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:27,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:27,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:27,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:27,870 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:52:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:28,016 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-02-10 20:52:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:28,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:28,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:28,020 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:52:28,020 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:52:28,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-02-10 20:52:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:52:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 777. [2020-02-10 20:52:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:52:28,045 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:52:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:28,045 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:52:28,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:52:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:28,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:28,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-02-10 20:52:28,047 INFO L427 AbstractCegarLoop]: === Iteration 1243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:28,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:28,047 INFO L82 PathProgramCache]: Analyzing trace with hash -450912897, now seen corresponding path program 1236 times [2020-02-10 20:52:28,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:28,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574581668] [2020-02-10 20:52:28,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:28,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574581668] [2020-02-10 20:52:28,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:28,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:28,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622324630] [2020-02-10 20:52:28,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:28,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:28,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:28,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:28,419 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:52:28,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:28,550 INFO L93 Difference]: Finished difference Result 1178 states and 4177 transitions. [2020-02-10 20:52:28,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:28,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:28,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:28,554 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 20:52:28,554 INFO L226 Difference]: Without dead ends: 1163 [2020-02-10 20:52:28,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-02-10 20:52:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-02-10 20:52:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 773. [2020-02-10 20:52:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:52:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:52:28,577 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:52:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:28,577 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:52:28,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:52:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:28,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:28,579 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:28,579 INFO L427 AbstractCegarLoop]: === Iteration 1244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:28,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:28,579 INFO L82 PathProgramCache]: Analyzing trace with hash 577041415, now seen corresponding path program 1237 times [2020-02-10 20:52:28,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:28,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046557935] [2020-02-10 20:52:28,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:28,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046557935] [2020-02-10 20:52:28,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:28,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:28,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593554857] [2020-02-10 20:52:28,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:28,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:28,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:28,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:28,935 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:52:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:29,059 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-02-10 20:52:29,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:29,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:29,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:29,063 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:52:29,063 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:52:29,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-02-10 20:52:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:52:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 779. [2020-02-10 20:52:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:52:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:52:29,086 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:52:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:29,086 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:52:29,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:52:29,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:29,088 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:29,088 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:29,088 INFO L427 AbstractCegarLoop]: === Iteration 1245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:29,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:29,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1568299237, now seen corresponding path program 1238 times [2020-02-10 20:52:29,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:29,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241314041] [2020-02-10 20:52:29,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:29,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241314041] [2020-02-10 20:52:29,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:29,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:29,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668760076] [2020-02-10 20:52:29,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:29,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:29,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:29,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:29,456 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:52:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:29,584 INFO L93 Difference]: Finished difference Result 1196 states and 4216 transitions. [2020-02-10 20:52:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:29,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:29,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:29,587 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:52:29,587 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:52:29,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:52:29,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-02-10 20:52:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:52:29,609 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:52:29,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:29,610 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:52:29,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:29,610 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:52:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:29,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:29,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-02-10 20:52:29,611 INFO L427 AbstractCegarLoop]: === Iteration 1246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:29,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:29,611 INFO L82 PathProgramCache]: Analyzing trace with hash 2060176353, now seen corresponding path program 1239 times [2020-02-10 20:52:29,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:29,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443298599] [2020-02-10 20:52:29,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:29,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443298599] [2020-02-10 20:52:29,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:29,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:29,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631146360] [2020-02-10 20:52:29,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:29,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:29,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:29,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:29,974 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:52:30,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:30,106 INFO L93 Difference]: Finished difference Result 1186 states and 4196 transitions. [2020-02-10 20:52:30,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:30,106 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:30,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:30,109 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:52:30,109 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:52:30,110 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:30,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:52:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 777. [2020-02-10 20:52:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:52:30,133 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:52:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:30,133 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:52:30,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:30,133 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:52:30,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:30,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:30,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:30,134 INFO L427 AbstractCegarLoop]: === Iteration 1247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:30,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:30,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1212023809, now seen corresponding path program 1240 times [2020-02-10 20:52:30,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:30,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066993949] [2020-02-10 20:52:30,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:30,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066993949] [2020-02-10 20:52:30,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:30,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:30,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655356447] [2020-02-10 20:52:30,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:30,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:30,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:30,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:30,489 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:52:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:30,620 INFO L93 Difference]: Finished difference Result 1184 states and 4190 transitions. [2020-02-10 20:52:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:30,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:30,623 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:52:30,624 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:52:30,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:52:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 20:52:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:52:30,646 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:52:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:30,646 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:52:30,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:52:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:30,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:30,647 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:30,648 INFO L427 AbstractCegarLoop]: === Iteration 1248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:30,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:30,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1085657977, now seen corresponding path program 1241 times [2020-02-10 20:52:30,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:30,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648547376] [2020-02-10 20:52:30,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:31,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648547376] [2020-02-10 20:52:31,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:31,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:31,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034213385] [2020-02-10 20:52:31,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:31,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:31,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:31,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:31,001 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:52:31,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:31,137 INFO L93 Difference]: Finished difference Result 1192 states and 4206 transitions. [2020-02-10 20:52:31,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:31,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:31,141 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:52:31,141 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:52: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-02-10 20:52:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:52:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 20:52:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:52:31,164 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:52:31,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:31,164 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:52:31,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:52:31,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:31,165 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:31,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-02-10 20:52:31,165 INFO L427 AbstractCegarLoop]: === Iteration 1249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:31,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:31,166 INFO L82 PathProgramCache]: Analyzing trace with hash -547802399, now seen corresponding path program 1242 times [2020-02-10 20:52:31,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:31,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508903577] [2020-02-10 20:52:31,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:31,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508903577] [2020-02-10 20:52:31,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:31,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:31,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935746836] [2020-02-10 20:52:31,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:31,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:31,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:31,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:31,520 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:52:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:31,653 INFO L93 Difference]: Finished difference Result 1187 states and 4194 transitions. [2020-02-10 20:52:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:31,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:31,657 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:52:31,657 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:52:31,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-02-10 20:52:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:52:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-02-10 20:52:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:52:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:52:31,680 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:52:31,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:31,680 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:52:31,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:52:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:31,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52: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-02-10 20:52:31,681 INFO L427 AbstractCegarLoop]: === Iteration 1250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:31,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1317631359, now seen corresponding path program 1243 times [2020-02-10 20:52:31,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:31,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788986914] [2020-02-10 20:52:31,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:32,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788986914] [2020-02-10 20:52:32,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:32,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:32,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936084288] [2020-02-10 20:52:32,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:32,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:32,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:32,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:32,045 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:52:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:32,172 INFO L93 Difference]: Finished difference Result 1188 states and 4200 transitions. [2020-02-10 20:52:32,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:32,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:32,176 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:52:32,176 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:52:32,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-02-10 20:52:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:52:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 778. [2020-02-10 20:52:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:52:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-02-10 20:52:32,199 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-02-10 20:52:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:32,199 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-02-10 20:52:32,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-02-10 20:52:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:32,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:32,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-02-10 20:52:32,200 INFO L427 AbstractCegarLoop]: === Iteration 1251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:32,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1366394979, now seen corresponding path program 1244 times [2020-02-10 20:52:32,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:32,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636922558] [2020-02-10 20:52:32,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:32,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636922558] [2020-02-10 20:52:32,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:32,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:32,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562433171] [2020-02-10 20:52:32,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:32,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:32,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:32,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:32,564 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:52:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:32,693 INFO L93 Difference]: Finished difference Result 1192 states and 4205 transitions. [2020-02-10 20:52:32,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:32,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:32,696 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:52:32,697 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:52:32,697 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:52:32,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-02-10 20:52:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:52:32,720 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:52:32,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:32,720 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:52:32,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:32,720 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:52:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:32,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:32,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-02-10 20:52:32,721 INFO L427 AbstractCegarLoop]: === Iteration 1252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:32,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:32,721 INFO L82 PathProgramCache]: Analyzing trace with hash 811285093, now seen corresponding path program 1245 times [2020-02-10 20:52:32,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:32,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740142844] [2020-02-10 20:52:32,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:33,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740142844] [2020-02-10 20:52:33,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:33,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:33,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671940770] [2020-02-10 20:52:33,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:33,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:33,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:33,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:33,098 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:52:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:33,227 INFO L93 Difference]: Finished difference Result 1182 states and 4185 transitions. [2020-02-10 20:52:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:33,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:33,230 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:52:33,230 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:52:33,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-02-10 20:52:33,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:52:33,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:52:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:52:33,253 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:52:33,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:33,253 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:52:33,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:33,253 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:52:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:33,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:33,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-02-10 20:52:33,254 INFO L427 AbstractCegarLoop]: === Iteration 1253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:33,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:33,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1334885667, now seen corresponding path program 1246 times [2020-02-10 20:52:33,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:33,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89751442] [2020-02-10 20:52:33,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:33,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89751442] [2020-02-10 20:52:33,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:33,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:33,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320296471] [2020-02-10 20:52:33,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:33,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:33,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:33,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:33,624 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:52:33,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:33,755 INFO L93 Difference]: Finished difference Result 1181 states and 4181 transitions. [2020-02-10 20:52:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:33,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:33,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:33,758 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:52:33,759 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:52:33,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:52:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 20:52:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:52:33,782 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:52:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:33,782 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:52:33,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:52:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:33,783 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:33,783 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:33,783 INFO L427 AbstractCegarLoop]: === Iteration 1254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:33,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:33,783 INFO L82 PathProgramCache]: Analyzing trace with hash 821788197, now seen corresponding path program 1247 times [2020-02-10 20:52:33,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:33,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257733312] [2020-02-10 20:52:33,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:34,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257733312] [2020-02-10 20:52:34,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:34,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:34,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564138305] [2020-02-10 20:52:34,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:34,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:34,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:34,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:34,144 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:52:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:34,272 INFO L93 Difference]: Finished difference Result 1190 states and 4199 transitions. [2020-02-10 20:52:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:34,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:34,275 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:52:34,275 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:52:34,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:52:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 777. [2020-02-10 20:52:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:52:34,299 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:52:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:34,299 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:52:34,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:52:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:34,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:34,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-02-10 20:52:34,300 INFO L427 AbstractCegarLoop]: === Iteration 1255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:34,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:34,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1359643775, now seen corresponding path program 1248 times [2020-02-10 20:52:34,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:34,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686022832] [2020-02-10 20:52:34,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52: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-02-10 20:52:34,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686022832] [2020-02-10 20:52:34,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:34,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:34,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382802591] [2020-02-10 20:52:34,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:34,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:34,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:34,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:34,672 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:52:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:34,814 INFO L93 Difference]: Finished difference Result 1185 states and 4187 transitions. [2020-02-10 20:52:34,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:34,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:34,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:34,817 INFO L225 Difference]: With dead ends: 1185 [2020-02-10 20:52:34,818 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:52:34,818 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:52:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 771. [2020-02-10 20:52:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:52:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-02-10 20:52:34,841 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-02-10 20:52:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:34,841 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-02-10 20:52:34,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-02-10 20:52:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:34,842 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:34,842 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:34,842 INFO L427 AbstractCegarLoop]: === Iteration 1256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:34,842 INFO L82 PathProgramCache]: Analyzing trace with hash -293691103, now seen corresponding path program 1249 times [2020-02-10 20:52:34,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:34,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689752540] [2020-02-10 20:52:34,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:35,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689752540] [2020-02-10 20:52:35,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:35,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:35,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593102462] [2020-02-10 20:52:35,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:35,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:35,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:35,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:35,227 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-02-10 20:52:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:35,367 INFO L93 Difference]: Finished difference Result 1188 states and 4209 transitions. [2020-02-10 20:52:35,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:35,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:35,371 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:52:35,371 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:52:35,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:52:35,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 779. [2020-02-10 20:52:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:52:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 20:52:35,394 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 20:52:35,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:35,394 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 20:52:35,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:35,395 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 20:52:35,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:35,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:35,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:35,396 INFO L427 AbstractCegarLoop]: === Iteration 1257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:35,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:35,396 INFO L82 PathProgramCache]: Analyzing trace with hash 687063615, now seen corresponding path program 1250 times [2020-02-10 20:52:35,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:35,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371121295] [2020-02-10 20:52:35,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:35,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371121295] [2020-02-10 20:52:35,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:35,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:35,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443982478] [2020-02-10 20:52:35,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:35,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:35,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:35,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:35,775 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:52:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:35,909 INFO L93 Difference]: Finished difference Result 1187 states and 4204 transitions. [2020-02-10 20:52:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:35,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:35,913 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:52:35,913 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:52:35,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:52:35,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 776. [2020-02-10 20:52:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:52:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3094 transitions. [2020-02-10 20:52:35,936 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3094 transitions. Word has length 25 [2020-02-10 20:52:35,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:35,936 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3094 transitions. [2020-02-10 20:52:35,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3094 transitions. [2020-02-10 20:52:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:35,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:35,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-02-10 20:52:35,938 INFO L427 AbstractCegarLoop]: === Iteration 1258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:35,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:35,938 INFO L82 PathProgramCache]: Analyzing trace with hash -736590243, now seen corresponding path program 1251 times [2020-02-10 20:52:35,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:35,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051464358] [2020-02-10 20:52:35,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:36,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-02-10 20:52:36,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051464358] [2020-02-10 20:52:36,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:36,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:36,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282693452] [2020-02-10 20:52:36,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:36,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:36,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:36,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:36,325 INFO L87 Difference]: Start difference. First operand 776 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:52:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:36,450 INFO L93 Difference]: Finished difference Result 1191 states and 4213 transitions. [2020-02-10 20:52:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:36,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:36,454 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:52:36,454 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:52:36,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-02-10 20:52:36,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:52:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 780. [2020-02-10 20:52:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:52:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3101 transitions. [2020-02-10 20:52:36,477 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3101 transitions. Word has length 25 [2020-02-10 20:52:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:36,477 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3101 transitions. [2020-02-10 20:52:36,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3101 transitions. [2020-02-10 20:52:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:36,478 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:36,478 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:36,479 INFO L427 AbstractCegarLoop]: === Iteration 1259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:36,479 INFO L82 PathProgramCache]: Analyzing trace with hash 265170683, now seen corresponding path program 1252 times [2020-02-10 20:52:36,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:36,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129350276] [2020-02-10 20:52:36,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:36,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129350276] [2020-02-10 20:52:36,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:36,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:36,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211804253] [2020-02-10 20:52:36,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:36,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:36,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:36,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:36,867 INFO L87 Difference]: Start difference. First operand 780 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:52:37,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:37,002 INFO L93 Difference]: Finished difference Result 1192 states and 4211 transitions. [2020-02-10 20:52:37,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:37,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:37,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:37,005 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:52:37,005 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:52:37,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:52:37,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 776. [2020-02-10 20:52:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:52:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3091 transitions. [2020-02-10 20:52:37,028 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3091 transitions. Word has length 25 [2020-02-10 20:52:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:37,028 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3091 transitions. [2020-02-10 20:52:37,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3091 transitions. [2020-02-10 20:52:37,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:37,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:37,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-02-10 20:52:37,029 INFO L427 AbstractCegarLoop]: === Iteration 1260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:37,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1676881249, now seen corresponding path program 1253 times [2020-02-10 20:52:37,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:37,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474173740] [2020-02-10 20:52:37,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:37,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474173740] [2020-02-10 20:52:37,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:37,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:37,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594725737] [2020-02-10 20:52:37,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:37,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:37,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:37,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:37,410 INFO L87 Difference]: Start difference. First operand 776 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:52:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:37,538 INFO L93 Difference]: Finished difference Result 1188 states and 4203 transitions. [2020-02-10 20:52:37,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:37,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:37,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:37,542 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:52:37,542 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:52:37,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:37,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:52:37,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 779. [2020-02-10 20:52:37,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:52:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 20:52:37,564 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 20:52:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:37,565 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 20:52:37,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 20:52:37,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:37,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:37,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:37,566 INFO L427 AbstractCegarLoop]: === Iteration 1261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:37,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:37,566 INFO L82 PathProgramCache]: Analyzing trace with hash 603795869, now seen corresponding path program 1254 times [2020-02-10 20:52:37,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:37,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663109721] [2020-02-10 20:52:37,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:37,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663109721] [2020-02-10 20:52:37,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:37,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:37,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838273274] [2020-02-10 20:52:37,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:37,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:37,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:37,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:37,943 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:52:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:38,079 INFO L93 Difference]: Finished difference Result 1190 states and 4204 transitions. [2020-02-10 20:52:38,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:38,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:38,083 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:52:38,083 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:52:38,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:38,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:52:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 773. [2020-02-10 20:52:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:52:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:52:38,106 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:52:38,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:38,106 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:52:38,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:52:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:38,107 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:38,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-02-10 20:52:38,107 INFO L427 AbstractCegarLoop]: === Iteration 1262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:38,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1138662555, now seen corresponding path program 1255 times [2020-02-10 20:52:38,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:38,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213900523] [2020-02-10 20:52:38,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:38,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213900523] [2020-02-10 20:52:38,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:38,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:38,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755097521] [2020-02-10 20:52:38,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:38,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:38,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:38,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:38,496 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:52:38,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:38,637 INFO L93 Difference]: Finished difference Result 1181 states and 4188 transitions. [2020-02-10 20:52:38,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:38,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:38,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:38,640 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:52:38,640 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:52:38,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-02-10 20:52:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:52:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 778. [2020-02-10 20:52:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:52:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 20:52:38,663 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 20:52:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:38,663 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 20:52:38,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 20:52:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:38,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:38,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:38,665 INFO L427 AbstractCegarLoop]: === Iteration 1263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:38,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:38,665 INFO L82 PathProgramCache]: Analyzing trace with hash -157907837, now seen corresponding path program 1256 times [2020-02-10 20:52:38,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:38,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117582378] [2020-02-10 20:52:38,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:39,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117582378] [2020-02-10 20:52:39,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:39,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:39,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508819566] [2020-02-10 20:52:39,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:39,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:39,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:39,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:39,052 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:52:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:39,185 INFO L93 Difference]: Finished difference Result 1180 states and 4183 transitions. [2020-02-10 20:52:39,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:39,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:39,189 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:52:39,189 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:52:39,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:52:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 775. [2020-02-10 20:52:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:52:39,211 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:52:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:39,212 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:52:39,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:52:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:39,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:39,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:39,213 INFO L427 AbstractCegarLoop]: === Iteration 1264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:39,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:39,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2024460835, now seen corresponding path program 1257 times [2020-02-10 20:52:39,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:39,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144218914] [2020-02-10 20:52:39,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:39,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144218914] [2020-02-10 20:52:39,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:39,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:39,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086469835] [2020-02-10 20:52:39,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:39,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:39,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:39,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:39,604 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:52:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:39,736 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-02-10 20:52:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:39,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:39,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:39,739 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:52:39,740 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:52:39,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-02-10 20:52:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:52:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 777. [2020-02-10 20:52:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:52:39,763 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:52:39,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:39,763 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:52:39,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:39,763 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:52:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:39,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:39,764 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:39,764 INFO L427 AbstractCegarLoop]: === Iteration 1265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:39,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1001693701, now seen corresponding path program 1258 times [2020-02-10 20:52:39,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:39,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439050605] [2020-02-10 20:52:39,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:40,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439050605] [2020-02-10 20:52:40,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:40,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:40,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742065834] [2020-02-10 20:52:40,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:40,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:40,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:40,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:40,139 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:52:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:40,270 INFO L93 Difference]: Finished difference Result 1177 states and 4175 transitions. [2020-02-10 20:52:40,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:40,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:40,273 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 20:52:40,273 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 20:52:40,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 20:52:40,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-02-10 20:52:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:40,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:52:40,295 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:52:40,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:40,295 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:52:40,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:52:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:40,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:40,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-02-10 20:52:40,296 INFO L427 AbstractCegarLoop]: === Iteration 1266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:40,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:40,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1483102245, now seen corresponding path program 1259 times [2020-02-10 20:52:40,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:40,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208116282] [2020-02-10 20:52:40,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:40,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208116282] [2020-02-10 20:52:40,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:40,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:40,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753263589] [2020-02-10 20:52:40,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:40,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:40,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:40,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:40,657 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:52:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:40,784 INFO L93 Difference]: Finished difference Result 1177 states and 4175 transitions. [2020-02-10 20:52:40,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:40,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:40,787 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 20:52:40,787 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:52:40,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-02-10 20:52:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:52:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-02-10 20:52:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:52:40,808 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:52:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:40,808 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:52:40,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:52:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:40,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:40,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-02-10 20:52:40,809 INFO L427 AbstractCegarLoop]: === Iteration 1267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:40,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:40,809 INFO L82 PathProgramCache]: Analyzing trace with hash -663068515, now seen corresponding path program 1260 times [2020-02-10 20:52:40,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:40,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325505051] [2020-02-10 20:52:40,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:41,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325505051] [2020-02-10 20:52:41,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:41,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:41,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191523304] [2020-02-10 20:52:41,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:41,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:41,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:41,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:41,166 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:52:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:41,312 INFO L93 Difference]: Finished difference Result 1176 states and 4171 transitions. [2020-02-10 20:52:41,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:41,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:41,315 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 20:52:41,315 INFO L226 Difference]: Without dead ends: 1161 [2020-02-10 20:52:41,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-02-10 20:52:41,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 773. [2020-02-10 20:52:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:52:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:52:41,337 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:52:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:41,337 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:52:41,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:41,337 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:52:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:41,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:41,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-02-10 20:52:41,338 INFO L427 AbstractCegarLoop]: === Iteration 1268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:41,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:41,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1868434149, now seen corresponding path program 1261 times [2020-02-10 20:52:41,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:41,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098888368] [2020-02-10 20:52:41,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:41,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098888368] [2020-02-10 20:52:41,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:41,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:41,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373642814] [2020-02-10 20:52:41,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:41,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:41,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:41,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:41,691 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:52:41,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:41,820 INFO L93 Difference]: Finished difference Result 1187 states and 4200 transitions. [2020-02-10 20:52:41,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:41,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:41,823 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:52:41,823 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:52:41,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:52:41,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 779. [2020-02-10 20:52:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:52:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 20:52:41,845 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 20:52:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:41,845 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 20:52:41,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 20:52:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:41,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:41,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-02-10 20:52:41,847 INFO L427 AbstractCegarLoop]: === Iteration 1269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:41,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1424772221, now seen corresponding path program 1262 times [2020-02-10 20:52:41,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:41,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205515906] [2020-02-10 20:52:41,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:42,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205515906] [2020-02-10 20:52:42,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:42,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:42,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877003389] [2020-02-10 20:52:42,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:42,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:42,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:42,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:42,215 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:52:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:42,354 INFO L93 Difference]: Finished difference Result 1188 states and 4198 transitions. [2020-02-10 20:52:42,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:42,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:42,358 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:52:42,358 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:52:42,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:52:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-02-10 20:52:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:52:42,380 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:52:42,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:42,380 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:52:42,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:52:42,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:42,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:42,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:42,381 INFO L427 AbstractCegarLoop]: === Iteration 1270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:42,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1425535009, now seen corresponding path program 1263 times [2020-02-10 20:52:42,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:42,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931286010] [2020-02-10 20:52:42,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:42,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931286010] [2020-02-10 20:52:42,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:42,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:42,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357914479] [2020-02-10 20:52:42,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:42,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:42,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:42,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:42,737 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:52:42,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:42,896 INFO L93 Difference]: Finished difference Result 1182 states and 4186 transitions. [2020-02-10 20:52:42,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:42,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:42,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:42,900 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:52:42,900 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:52:42,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:42,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:52:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 20:52:42,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:52:42,922 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:52:42,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:42,922 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:52:42,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:42,922 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:52:42,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:42,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:42,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-02-10 20:52:42,923 INFO L427 AbstractCegarLoop]: === Iteration 1271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:42,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:42,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1846665153, now seen corresponding path program 1264 times [2020-02-10 20:52:42,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:42,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944244786] [2020-02-10 20:52:42,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:43,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-02-10 20:52:43,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944244786] [2020-02-10 20:52:43,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:43,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:43,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596785420] [2020-02-10 20:52:43,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:43,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:43,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:43,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:43,280 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:52:43,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:43,411 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-02-10 20:52:43,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:43,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:43,414 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:52:43,414 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:52:43,414 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:52:43,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-02-10 20:52:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:52:43,436 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:52:43,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:43,436 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:52:43,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:43,436 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:52:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:43,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:43,437 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:43,437 INFO L427 AbstractCegarLoop]: === Iteration 1272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:43,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:43,437 INFO L82 PathProgramCache]: Analyzing trace with hash 216237861, now seen corresponding path program 1265 times [2020-02-10 20:52:43,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:43,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785006745] [2020-02-10 20:52:43,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:43,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785006745] [2020-02-10 20:52:43,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:43,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:43,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034685358] [2020-02-10 20:52:43,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:43,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:43,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:43,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:43,803 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:52:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:43,943 INFO L93 Difference]: Finished difference Result 1184 states and 4188 transitions. [2020-02-10 20:52:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:43,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:43,946 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:52:43,946 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:52:43,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:52:43,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:52:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:52:43,968 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:52:43,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:43,968 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:52:43,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:52:43,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:43,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:43,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-02-10 20:52:43,969 INFO L427 AbstractCegarLoop]: === Iteration 1273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:43,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:43,969 INFO L82 PathProgramCache]: Analyzing trace with hash -856847519, now seen corresponding path program 1266 times [2020-02-10 20:52:43,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:43,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306966343] [2020-02-10 20:52:43,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:44,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306966343] [2020-02-10 20:52:44,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:44,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:44,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998357060] [2020-02-10 20:52:44,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:44,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:44,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:44,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:44,322 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:52:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:44,487 INFO L93 Difference]: Finished difference Result 1181 states and 4180 transitions. [2020-02-10 20:52:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:44,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:44,491 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:52:44,491 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:52:44,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:52:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 773. [2020-02-10 20:52:44,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:52:44,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 20:52:44,514 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 20:52:44,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:44,514 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 20:52:44,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:44,514 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 20:52:44,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:44,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:44,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-02-10 20:52:44,515 INFO L427 AbstractCegarLoop]: === Iteration 1274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:44,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:44,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1008586239, now seen corresponding path program 1267 times [2020-02-10 20:52:44,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:44,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322539679] [2020-02-10 20:52:44,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:44,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322539679] [2020-02-10 20:52:44,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:44,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:44,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844834011] [2020-02-10 20:52:44,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:44,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:44,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:44,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:44,869 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 20:52:45,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:45,000 INFO L93 Difference]: Finished difference Result 1182 states and 4186 transitions. [2020-02-10 20:52:45,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:45,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:45,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:45,003 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:52:45,003 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:52:45,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:52:45,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 778. [2020-02-10 20:52:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:52:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-02-10 20:52:45,024 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-02-10 20:52:45,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:45,024 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-02-10 20:52:45,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-02-10 20:52:45,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:45,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:45,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-02-10 20:52:45,026 INFO L427 AbstractCegarLoop]: === Iteration 1275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:45,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:45,026 INFO L82 PathProgramCache]: Analyzing trace with hash -64499141, now seen corresponding path program 1268 times [2020-02-10 20:52:45,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:45,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926675236] [2020-02-10 20:52:45,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:45,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-02-10 20:52:45,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926675236] [2020-02-10 20:52:45,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:45,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:45,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025337827] [2020-02-10 20:52:45,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:45,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:45,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:45,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:45,372 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:52:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:45,519 INFO L93 Difference]: Finished difference Result 1184 states and 4187 transitions. [2020-02-10 20:52:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:45,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:45,522 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:52:45,522 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:52:45,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:52:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-02-10 20:52:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:52:45,544 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:52:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:45,544 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:52:45,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:52:45,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:45,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:45,545 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:45,545 INFO L427 AbstractCegarLoop]: === Iteration 1276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:45,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:45,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2102677827, now seen corresponding path program 1269 times [2020-02-10 20:52:45,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:45,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939969150] [2020-02-10 20:52:45,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:45,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939969150] [2020-02-10 20:52:45,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:45,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:45,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673805795] [2020-02-10 20:52:45,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:45,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:45,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:45,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:45,906 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:52:46,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:46,030 INFO L93 Difference]: Finished difference Result 1178 states and 4175 transitions. [2020-02-10 20:52:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:46,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:46,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:46,034 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 20:52:46,034 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:52:46,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-02-10 20:52:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:52:46,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 777. [2020-02-10 20:52:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:52:46,055 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:52:46,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:46,055 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:52:46,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:46,055 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:52:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:46,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:46,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-02-10 20:52:46,057 INFO L427 AbstractCegarLoop]: === Iteration 1277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:46,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:46,057 INFO L82 PathProgramCache]: Analyzing trace with hash -43492933, now seen corresponding path program 1270 times [2020-02-10 20:52:46,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:46,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259992017] [2020-02-10 20:52:46,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:46,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259992017] [2020-02-10 20:52:46,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:46,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:46,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218646323] [2020-02-10 20:52:46,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:46,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:46,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:46,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:46,430 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:52:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:46,574 INFO L93 Difference]: Finished difference Result 1177 states and 4171 transitions. [2020-02-10 20:52:46,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:46,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:46,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:46,578 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 20:52:46,578 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 20:52:46,578 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:46,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 20:52:46,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-02-10 20:52:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:52:46,599 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:52:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:46,599 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:52:46,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:52:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:46,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:46,600 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:46,600 INFO L427 AbstractCegarLoop]: === Iteration 1278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:46,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:46,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2123684035, now seen corresponding path program 1271 times [2020-02-10 20:52:46,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:46,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522594016] [2020-02-10 20:52:46,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:46,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-02-10 20:52:46,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522594016] [2020-02-10 20:52:46,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:46,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:46,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738174903] [2020-02-10 20:52:46,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:46,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:46,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:46,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:46,954 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:52:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:47,082 INFO L93 Difference]: Finished difference Result 1182 states and 4181 transitions. [2020-02-10 20:52:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:47,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:47,085 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:52:47,085 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:52:47,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:47,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:52:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 20:52:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:52:47,106 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:52:47,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:47,106 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:52:47,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:52:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:47,107 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:47,107 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:47,107 INFO L427 AbstractCegarLoop]: === Iteration 1279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:47,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:47,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1050598655, now seen corresponding path program 1272 times [2020-02-10 20:52:47,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:47,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45428594] [2020-02-10 20:52:47,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:47,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45428594] [2020-02-10 20:52:47,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:47,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:47,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563758201] [2020-02-10 20:52:47,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:47,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:47,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:47,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:47,472 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:52:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:47,628 INFO L93 Difference]: Finished difference Result 1179 states and 4173 transitions. [2020-02-10 20:52:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:47,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:47,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:47,632 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:52:47,632 INFO L226 Difference]: Without dead ends: 1162 [2020-02-10 20:52:47,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-02-10 20:52:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-02-10 20:52:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 771. [2020-02-10 20:52:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:52:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3075 transitions. [2020-02-10 20:52:47,655 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3075 transitions. Word has length 25 [2020-02-10 20:52:47,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:47,655 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3075 transitions. [2020-02-10 20:52:47,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3075 transitions. [2020-02-10 20:52:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:47,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:47,656 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:47,656 INFO L427 AbstractCegarLoop]: === Iteration 1280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:47,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:47,656 INFO L82 PathProgramCache]: Analyzing trace with hash 997701631, now seen corresponding path program 1273 times [2020-02-10 20:52:47,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:47,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079418961] [2020-02-10 20:52:47,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:48,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079418961] [2020-02-10 20:52:48,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:48,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:48,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326857271] [2020-02-10 20:52:48,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:48,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:48,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:48,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:48,001 INFO L87 Difference]: Start difference. First operand 771 states and 3075 transitions. Second operand 10 states. [2020-02-10 20:52:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:48,144 INFO L93 Difference]: Finished difference Result 1209 states and 4260 transitions. [2020-02-10 20:52:48,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:48,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:48,148 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:52:48,148 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:52:48,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:52:48,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 781. [2020-02-10 20:52:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:52:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3106 transitions. [2020-02-10 20:52:48,169 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3106 transitions. Word has length 25 [2020-02-10 20:52:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:48,169 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3106 transitions. [2020-02-10 20:52:48,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3106 transitions. [2020-02-10 20:52:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:48,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:48,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-02-10 20:52:48,170 INFO L427 AbstractCegarLoop]: === Iteration 1281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:48,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:48,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1988959453, now seen corresponding path program 1274 times [2020-02-10 20:52:48,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:48,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215231056] [2020-02-10 20:52:48,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:48,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215231056] [2020-02-10 20:52:48,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:48,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:48,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41850639] [2020-02-10 20:52:48,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:48,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:48,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:48,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:48,497 INFO L87 Difference]: Start difference. First operand 781 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:52:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:48,621 INFO L93 Difference]: Finished difference Result 1212 states and 4262 transitions. [2020-02-10 20:52:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:48,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:48,624 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:52:48,624 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:52:48,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:48,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:52:48,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 777. [2020-02-10 20:52:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:48,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-02-10 20:52:48,646 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-02-10 20:52:48,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:48,646 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-02-10 20:52:48,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:48,646 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-02-10 20:52:48,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:48,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:48,647 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:48,648 INFO L427 AbstractCegarLoop]: === Iteration 1282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:48,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:48,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1371231587, now seen corresponding path program 1275 times [2020-02-10 20:52:48,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:48,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541706008] [2020-02-10 20:52:48,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:48,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541706008] [2020-02-10 20:52:48,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:48,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:48,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135964268] [2020-02-10 20:52:48,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:48,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:48,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:48,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:48,985 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:52:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:49,109 INFO L93 Difference]: Finished difference Result 1207 states and 4252 transitions. [2020-02-10 20:52:49,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:49,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:49,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:49,113 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:52:49,113 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:52:49,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:52:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-02-10 20:52:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:52:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-02-10 20:52:49,134 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-02-10 20:52:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:49,135 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-02-10 20:52:49,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-02-10 20:52:49,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:49,136 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:49,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-02-10 20:52:49,136 INFO L427 AbstractCegarLoop]: === Iteration 1283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:49,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:49,136 INFO L82 PathProgramCache]: Analyzing trace with hash -369470661, now seen corresponding path program 1276 times [2020-02-10 20:52:49,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:49,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634840675] [2020-02-10 20:52:49,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:49,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634840675] [2020-02-10 20:52:49,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:49,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:49,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558077481] [2020-02-10 20:52:49,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:49,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:49,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:49,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:49,473 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:52:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:49,601 INFO L93 Difference]: Finished difference Result 1208 states and 4250 transitions. [2020-02-10 20:52:49,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:49,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:49,604 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:52:49,604 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:52:49,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:49,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:52:49,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 20:52:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3091 transitions. [2020-02-10 20:52:49,627 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3091 transitions. Word has length 25 [2020-02-10 20:52:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:49,627 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3091 transitions. [2020-02-10 20:52:49,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3091 transitions. [2020-02-10 20:52:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:49,628 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:49,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:49,629 INFO L427 AbstractCegarLoop]: === Iteration 1284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:49,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:49,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1316190209, now seen corresponding path program 1277 times [2020-02-10 20:52:49,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:49,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414845332] [2020-02-10 20:52:49,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:49,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414845332] [2020-02-10 20:52:49,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:49,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:49,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368161063] [2020-02-10 20:52:49,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:49,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:49,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:49,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:49,961 INFO L87 Difference]: Start difference. First operand 777 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:52:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:50,082 INFO L93 Difference]: Finished difference Result 1214 states and 4263 transitions. [2020-02-10 20:52:50,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:50,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:50,085 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:52:50,085 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:52:50,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:52:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 782. [2020-02-10 20:52:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:52:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3100 transitions. [2020-02-10 20:52:50,108 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3100 transitions. Word has length 25 [2020-02-10 20:52:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:50,108 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3100 transitions. [2020-02-10 20:52:50,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3100 transitions. [2020-02-10 20:52:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:50,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:50,109 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:50,109 INFO L427 AbstractCegarLoop]: === Iteration 1285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:50,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:50,109 INFO L82 PathProgramCache]: Analyzing trace with hash 294750749, now seen corresponding path program 1278 times [2020-02-10 20:52:50,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:50,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199578623] [2020-02-10 20:52:50,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:50,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199578623] [2020-02-10 20:52:50,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:50,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:50,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376559705] [2020-02-10 20:52:50,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:50,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:50,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:50,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:50,440 INFO L87 Difference]: Start difference. First operand 782 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:52:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:50,593 INFO L93 Difference]: Finished difference Result 1212 states and 4254 transitions. [2020-02-10 20:52:50,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:50,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:50,596 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:52:50,596 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 20:52:50,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 20:52:50,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 773. [2020-02-10 20:52:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:52:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:52:50,618 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:52:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:50,618 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:52:50,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:52:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:50,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:50,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-02-10 20:52:50,620 INFO L427 AbstractCegarLoop]: === Iteration 1286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:50,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:50,620 INFO L82 PathProgramCache]: Analyzing trace with hash 152730179, now seen corresponding path program 1279 times [2020-02-10 20:52:50,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:50,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252532917] [2020-02-10 20:52:50,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:50,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252532917] [2020-02-10 20:52:50,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:50,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:50,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509694770] [2020-02-10 20:52:50,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:50,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:50,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:50,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:50,945 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:52:51,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:51,076 INFO L93 Difference]: Finished difference Result 1199 states and 4229 transitions. [2020-02-10 20:52:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:51,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:51,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:51,080 INFO L225 Difference]: With dead ends: 1199 [2020-02-10 20:52:51,080 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:52:51,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:52:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 779. [2020-02-10 20:52:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:52:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 20:52:51,102 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 20:52:51,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:51,102 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 20:52:51,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 20:52:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:51,103 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:51,103 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:51,103 INFO L427 AbstractCegarLoop]: === Iteration 1287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:51,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:51,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1143988001, now seen corresponding path program 1280 times [2020-02-10 20:52:51,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:51,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100046375] [2020-02-10 20:52:51,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:51,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100046375] [2020-02-10 20:52:51,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:51,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:51,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461103607] [2020-02-10 20:52:51,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:51,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:51,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:51,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:51,426 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:52:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:51,554 INFO L93 Difference]: Finished difference Result 1202 states and 4231 transitions. [2020-02-10 20:52:51,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:51,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:51,558 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:52:51,558 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:52:51,558 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:52:51,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 775. [2020-02-10 20:52:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:52:51,580 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:52:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:51,580 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:52:51,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:52:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:51,581 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:51,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-02-10 20:52:51,581 INFO L427 AbstractCegarLoop]: === Iteration 1288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:51,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:51,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1635865117, now seen corresponding path program 1281 times [2020-02-10 20:52:51,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:51,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338168234] [2020-02-10 20:52:51,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:51,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338168234] [2020-02-10 20:52:51,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:51,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:51,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901654804] [2020-02-10 20:52:51,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:51,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:51,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:51,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:51,922 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:52:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:52,059 INFO L93 Difference]: Finished difference Result 1192 states and 4211 transitions. [2020-02-10 20:52:52,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:52,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:52,062 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:52:52,063 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:52:52,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:52,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:52:52,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 777. [2020-02-10 20:52:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:52:52,084 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:52:52,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:52,084 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:52:52,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:52:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:52,085 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:52,085 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:52,085 INFO L427 AbstractCegarLoop]: === Iteration 1289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:52,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:52,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1636335045, now seen corresponding path program 1282 times [2020-02-10 20:52:52,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:52,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750708425] [2020-02-10 20:52:52,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:52,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750708425] [2020-02-10 20:52:52,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:52,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:52,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980253268] [2020-02-10 20:52:52,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:52,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:52,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:52,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:52,408 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:52:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:52,535 INFO L93 Difference]: Finished difference Result 1190 states and 4205 transitions. [2020-02-10 20:52:52,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:52,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:52,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:52,539 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:52:52,539 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 20:52:52,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:52,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 20:52:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-02-10 20:52:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:52:52,561 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:52:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:52,561 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:52:52,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:52:52,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:52,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:52,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-02-10 20:52:52,562 INFO L427 AbstractCegarLoop]: === Iteration 1290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:52,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:52,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1509969213, now seen corresponding path program 1283 times [2020-02-10 20:52:52,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:52,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106589266] [2020-02-10 20:52:52,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:52,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106589266] [2020-02-10 20:52:52,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:52,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:52,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504222018] [2020-02-10 20:52:52,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:52,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:52,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:52,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:52,877 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:52:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:52,999 INFO L93 Difference]: Finished difference Result 1198 states and 4221 transitions. [2020-02-10 20:52:52,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:52,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:53,002 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 20:52:53,002 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:52:53,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:53,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:52:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-02-10 20:52:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:52:53,023 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:52:53,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:53,023 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:52:53,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:52:53,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:53,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:53,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-02-10 20:52:53,025 INFO L427 AbstractCegarLoop]: === Iteration 1291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:53,025 INFO L82 PathProgramCache]: Analyzing trace with hash -972113635, now seen corresponding path program 1284 times [2020-02-10 20:52:53,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:53,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806205109] [2020-02-10 20:52:53,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:53,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806205109] [2020-02-10 20:52:53,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:53,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:53,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992499209] [2020-02-10 20:52:53,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:53,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:53,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:53,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:53,340 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:52:53,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:53,484 INFO L93 Difference]: Finished difference Result 1193 states and 4209 transitions. [2020-02-10 20:52:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:53,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:53,487 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:52:53,487 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:52:53,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:52:53,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 773. [2020-02-10 20:52:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:52:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 20:52:53,509 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 20:52:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:53,509 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 20:52:53,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 20:52:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:53,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:53,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-02-10 20:52:53,510 INFO L427 AbstractCegarLoop]: === Iteration 1292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:53,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:53,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1656278531, now seen corresponding path program 1285 times [2020-02-10 20:52:53,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:53,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291338816] [2020-02-10 20:52:53,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:53,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291338816] [2020-02-10 20:52:53,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:53,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:53,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309866213] [2020-02-10 20:52:53,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:53,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:53,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:53,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:53,844 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 20:52:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:53,996 INFO L93 Difference]: Finished difference Result 1195 states and 4219 transitions. [2020-02-10 20:52:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:53,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:54,000 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:52:54,000 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:52:54,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:52:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 20:52:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:52:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3094 transitions. [2020-02-10 20:52:54,022 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3094 transitions. Word has length 25 [2020-02-10 20:52:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:54,022 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3094 transitions. [2020-02-10 20:52:54,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3094 transitions. [2020-02-10 20:52:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:54,023 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:54,023 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:54,023 INFO L427 AbstractCegarLoop]: === Iteration 1293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:54,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:54,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1636927839, now seen corresponding path program 1286 times [2020-02-10 20:52:54,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:54,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426814394] [2020-02-10 20:52:54,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:54,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426814394] [2020-02-10 20:52:54,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:54,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:54,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666615151] [2020-02-10 20:52:54,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:54,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:54,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:54,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:54,360 INFO L87 Difference]: Start difference. First operand 779 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:52:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:54,484 INFO L93 Difference]: Finished difference Result 1196 states and 4217 transitions. [2020-02-10 20:52:54,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:54,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:54,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:54,487 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:52:54,487 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:52:54,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:52:54,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 20:52:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:52:54,509 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:52:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:54,509 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:52:54,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:52:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:54,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:54,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-02-10 20:52:54,510 INFO L427 AbstractCegarLoop]: === Iteration 1294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:54,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1213379391, now seen corresponding path program 1287 times [2020-02-10 20:52:54,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:54,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678493947] [2020-02-10 20:52:54,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:54,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678493947] [2020-02-10 20:52:54,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:54,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:54,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293895311] [2020-02-10 20:52:54,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:54,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:54,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:54,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:54,846 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:52:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:54,973 INFO L93 Difference]: Finished difference Result 1190 states and 4205 transitions. [2020-02-10 20:52:54,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:54,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:54,977 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:52:54,977 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 20:52:54,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 20:52:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 777. [2020-02-10 20:52:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:52:54,999 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:52:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:54,999 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:52:54,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:52:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:55,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:55,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:55,000 INFO L427 AbstractCegarLoop]: === Iteration 1295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:55,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:55,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2058820771, now seen corresponding path program 1288 times [2020-02-10 20:52:55,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:55,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202374389] [2020-02-10 20:52:55,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:55,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202374389] [2020-02-10 20:52:55,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:55,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:55,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931187454] [2020-02-10 20:52:55,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:55,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:55,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:55,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:55,332 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:52:55,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:55,458 INFO L93 Difference]: Finished difference Result 1188 states and 4199 transitions. [2020-02-10 20:52:55,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:55,459 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:55,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:55,462 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:52:55,462 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:52:55,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:55,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:52:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-02-10 20:52:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:52:55,484 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:52:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:55,484 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:52:55,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:52:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:55,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:55,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-02-10 20:52:55,485 INFO L427 AbstractCegarLoop]: === Iteration 1296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:55,485 INFO L82 PathProgramCache]: Analyzing trace with hash 4082243, now seen corresponding path program 1289 times [2020-02-10 20:52:55,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:55,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310785249] [2020-02-10 20:52:55,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:55,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310785249] [2020-02-10 20:52:55,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:55,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:55,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882730708] [2020-02-10 20:52:55,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:55,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:55,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:55,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:55,809 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:52:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:55,934 INFO L93 Difference]: Finished difference Result 1192 states and 4207 transitions. [2020-02-10 20:52:55,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:55,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:55,937 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:52:55,937 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:52:55,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:52:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 20:52:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:52:55,974 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:52:55,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:55,974 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:52:55,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:52:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:55,975 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:55,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-02-10 20:52:55,975 INFO L427 AbstractCegarLoop]: === Iteration 1297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:55,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:55,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1069003137, now seen corresponding path program 1290 times [2020-02-10 20:52:55,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:55,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028327600] [2020-02-10 20:52:55,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:56,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028327600] [2020-02-10 20:52:56,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:56,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:56,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853473213] [2020-02-10 20:52:56,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:56,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:56,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:56,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:56,303 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:52:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:56,432 INFO L93 Difference]: Finished difference Result 1189 states and 4199 transitions. [2020-02-10 20:52:56,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:56,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:56,436 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:52:56,436 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:52:56,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:52:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 773. [2020-02-10 20:52:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:52:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-02-10 20:52:56,457 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-02-10 20:52:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:56,457 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-02-10 20:52:56,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-02-10 20:52:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:56,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:56,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-02-10 20:52:56,459 INFO L427 AbstractCegarLoop]: === Iteration 1298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:56,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:56,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1984485219, now seen corresponding path program 1291 times [2020-02-10 20:52:56,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:56,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164744827] [2020-02-10 20:52:56,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:56,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164744827] [2020-02-10 20:52:56,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:56,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:56,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592852623] [2020-02-10 20:52:56,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:56,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:56,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:56,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:56,781 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-02-10 20:52:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:56,905 INFO L93 Difference]: Finished difference Result 1206 states and 4241 transitions. [2020-02-10 20:52:56,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:56,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:56,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:56,909 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:52:56,909 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:52:56,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:56,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:52:56,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 780. [2020-02-10 20:52:56,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:52:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3094 transitions. [2020-02-10 20:52:56,930 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3094 transitions. Word has length 25 [2020-02-10 20:52:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:56,930 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3094 transitions. [2020-02-10 20:52:56,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3094 transitions. [2020-02-10 20:52:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:56,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:56,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-02-10 20:52:56,932 INFO L427 AbstractCegarLoop]: === Iteration 1299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:56,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:56,932 INFO L82 PathProgramCache]: Analyzing trace with hash -373544261, now seen corresponding path program 1292 times [2020-02-10 20:52:56,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:56,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579733380] [2020-02-10 20:52:56,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:57,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579733380] [2020-02-10 20:52:57,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:57,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:57,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262667564] [2020-02-10 20:52:57,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:57,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:57,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:57,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:57,252 INFO L87 Difference]: Start difference. First operand 780 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:52:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:57,405 INFO L93 Difference]: Finished difference Result 1204 states and 4232 transitions. [2020-02-10 20:52:57,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:57,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:57,410 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:52:57,410 INFO L226 Difference]: Without dead ends: 1185 [2020-02-10 20:52:57,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:57,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-02-10 20:52:57,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 775. [2020-02-10 20:52:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:52:57,432 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:52:57,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:57,432 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:52:57,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:52:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:57,433 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:57,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-02-10 20:52:57,433 INFO L427 AbstractCegarLoop]: === Iteration 1300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:57,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:57,433 INFO L82 PathProgramCache]: Analyzing trace with hash -890393631, now seen corresponding path program 1293 times [2020-02-10 20:52:57,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:57,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604184086] [2020-02-10 20:52:57,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:57,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604184086] [2020-02-10 20:52:57,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:57,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:57,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518116518] [2020-02-10 20:52:57,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:57,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:57,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:57,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:57,744 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:52:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:57,888 INFO L93 Difference]: Finished difference Result 1200 states and 4224 transitions. [2020-02-10 20:52:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:57,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:57,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:57,891 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:52:57,891 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:52:57,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:52:57,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 777. [2020-02-10 20:52:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:52:57,913 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:52:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:57,913 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:52:57,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:52:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:57,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:57,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-02-10 20:52:57,914 INFO L427 AbstractCegarLoop]: === Iteration 1301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:57,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:57,915 INFO L82 PathProgramCache]: Analyzing trace with hash -352538053, now seen corresponding path program 1294 times [2020-02-10 20:52:57,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:57,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760941404] [2020-02-10 20:52:57,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:58,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760941404] [2020-02-10 20:52:58,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:58,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:58,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601807086] [2020-02-10 20:52:58,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:58,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:58,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:58,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:58,226 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:52:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:58,356 INFO L93 Difference]: Finished difference Result 1195 states and 4212 transitions. [2020-02-10 20:52:58,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:58,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:58,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:58,359 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:52:58,359 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:52:58,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:52:58,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 775. [2020-02-10 20:52:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:52:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-02-10 20:52:58,381 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-02-10 20:52:58,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:58,381 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-02-10 20:52:58,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:58,381 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-02-10 20:52:58,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:58,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:58,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-02-10 20:52:58,382 INFO L427 AbstractCegarLoop]: === Iteration 1302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:58,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:58,382 INFO L82 PathProgramCache]: Analyzing trace with hash -879890527, now seen corresponding path program 1295 times [2020-02-10 20:52:58,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:58,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495425498] [2020-02-10 20:52:58,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:58,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-02-10 20:52:58,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495425498] [2020-02-10 20:52:58,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:58,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:58,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017267491] [2020-02-10 20:52:58,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:58,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:58,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:58,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:58,699 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-02-10 20:52:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:58,843 INFO L93 Difference]: Finished difference Result 1196 states and 4214 transitions. [2020-02-10 20:52:58,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:58,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:58,846 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:52:58,847 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:52:58,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:52:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-02-10 20:52:58,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:52:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-02-10 20:52:58,868 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-02-10 20:52:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:58,868 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-02-10 20:52:58,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-02-10 20:52:58,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:58,869 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:58,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-02-10 20:52:58,870 INFO L427 AbstractCegarLoop]: === Iteration 1303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:58,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:58,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1952975907, now seen corresponding path program 1296 times [2020-02-10 20:52:58,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:58,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046227472] [2020-02-10 20:52:58,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:52:59,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046227472] [2020-02-10 20:52:59,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:59,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:59,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453988020] [2020-02-10 20:52:59,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:59,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:59,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:59,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:59,188 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:52:59,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:59,320 INFO L93 Difference]: Finished difference Result 1193 states and 4206 transitions. [2020-02-10 20:52:59,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:59,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:59,323 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:52:59,323 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:52:59,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:52:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 771. [2020-02-10 20:52:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:52:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3073 transitions. [2020-02-10 20:52:59,345 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3073 transitions. Word has length 25 [2020-02-10 20:52:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:59,345 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3073 transitions. [2020-02-10 20:52:59,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3073 transitions. [2020-02-10 20:52:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:59,346 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:59,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-02-10 20:52:59,347 INFO L427 AbstractCegarLoop]: === Iteration 1304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:59,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:59,347 INFO L82 PathProgramCache]: Analyzing trace with hash -507462939, now seen corresponding path program 1297 times [2020-02-10 20:52:59,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:59,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926564642] [2020-02-10 20:52:59,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:52:59,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-02-10 20:52:59,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926564642] [2020-02-10 20:52:59,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:52:59,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:52:59,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10172300] [2020-02-10 20:52:59,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:52:59,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:52:59,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:52:59,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:52:59,666 INFO L87 Difference]: Start difference. First operand 771 states and 3073 transitions. Second operand 10 states. [2020-02-10 20:52:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:52:59,789 INFO L93 Difference]: Finished difference Result 1198 states and 4227 transitions. [2020-02-10 20:52:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:52:59,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:52:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:52:59,792 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 20:52:59,793 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:52:59,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:52:59,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:52:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 779. [2020-02-10 20:52:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:52:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:52:59,814 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:52:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:52:59,814 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:52:59,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:52:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:52:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:52:59,816 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:52:59,816 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:52:59,816 INFO L427 AbstractCegarLoop]: === Iteration 1305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:52:59,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:52:59,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1103478019, now seen corresponding path program 1298 times [2020-02-10 20:52:59,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:52:59,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786244810] [2020-02-10 20:52:59,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:52:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:00,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786244810] [2020-02-10 20:53:00,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:00,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:00,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963498557] [2020-02-10 20:53:00,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:00,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:00,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:00,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:00,147 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:53:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:00,275 INFO L93 Difference]: Finished difference Result 1202 states and 4232 transitions. [2020-02-10 20:53:00,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:00,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:00,278 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:53:00,279 INFO L226 Difference]: Without dead ends: 1183 [2020-02-10 20:53:00,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-02-10 20:53:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 776. [2020-02-10 20:53:00,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:53:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3090 transitions. [2020-02-10 20:53:00,301 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3090 transitions. Word has length 25 [2020-02-10 20:53:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:00,301 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3090 transitions. [2020-02-10 20:53:00,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3090 transitions. [2020-02-10 20:53:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:00,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:00,302 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:00,302 INFO L427 AbstractCegarLoop]: === Iteration 1306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:00,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:00,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2107900793, now seen corresponding path program 1299 times [2020-02-10 20:53:00,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:00,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741862038] [2020-02-10 20:53:00,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:00,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741862038] [2020-02-10 20:53:00,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:00,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:00,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060183747] [2020-02-10 20:53:00,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:00,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:00,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:00,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:00,628 INFO L87 Difference]: Start difference. First operand 776 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:53:00,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:00,751 INFO L93 Difference]: Finished difference Result 1196 states and 4220 transitions. [2020-02-10 20:53:00,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:00,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:00,754 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:53:00,754 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:53:00,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:53:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 779. [2020-02-10 20:53:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:53:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3095 transitions. [2020-02-10 20:53:00,776 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3095 transitions. Word has length 25 [2020-02-10 20:53:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:00,776 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3095 transitions. [2020-02-10 20:53:00,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:00,776 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3095 transitions. [2020-02-10 20:53:00,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:00,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:00,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-02-10 20:53:00,777 INFO L427 AbstractCegarLoop]: === Iteration 1307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:00,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:00,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1113981123, now seen corresponding path program 1300 times [2020-02-10 20:53:00,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:00,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061140169] [2020-02-10 20:53:00,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:01,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061140169] [2020-02-10 20:53:01,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:01,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:01,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882477750] [2020-02-10 20:53:01,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:01,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:01,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:01,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:01,100 INFO L87 Difference]: Start difference. First operand 779 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:53:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:01,236 INFO L93 Difference]: Finished difference Result 1198 states and 4221 transitions. [2020-02-10 20:53:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:01,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:01,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:01,239 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 20:53:01,239 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:53:01,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:01,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:53:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 776. [2020-02-10 20:53:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:53:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3087 transitions. [2020-02-10 20:53:01,261 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3087 transitions. Word has length 25 [2020-02-10 20:53:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:01,261 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3087 transitions. [2020-02-10 20:53:01,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3087 transitions. [2020-02-10 20:53:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:01,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:01,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-02-10 20:53:01,263 INFO L427 AbstractCegarLoop]: === Iteration 1308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:01,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:01,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2097397689, now seen corresponding path program 1301 times [2020-02-10 20:53:01,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:01,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526160989] [2020-02-10 20:53:01,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:01,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526160989] [2020-02-10 20:53:01,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:01,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:01,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522020899] [2020-02-10 20:53:01,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:01,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:01,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:01,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:01,589 INFO L87 Difference]: Start difference. First operand 776 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:53:01,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:01,712 INFO L93 Difference]: Finished difference Result 1206 states and 4239 transitions. [2020-02-10 20:53:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:01,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:01,715 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:53:01,716 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:53:01,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:01,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:53:01,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 781. [2020-02-10 20:53:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:53:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3096 transitions. [2020-02-10 20:53:01,737 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3096 transitions. Word has length 25 [2020-02-10 20:53:01,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:01,737 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3096 transitions. [2020-02-10 20:53:01,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3096 transitions. [2020-02-10 20:53:01,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:01,738 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:01,738 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:01,738 INFO L427 AbstractCegarLoop]: === Iteration 1309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:01,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:01,739 INFO L82 PathProgramCache]: Analyzing trace with hash -486456731, now seen corresponding path program 1302 times [2020-02-10 20:53:01,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:01,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046481148] [2020-02-10 20:53:01,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:02,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046481148] [2020-02-10 20:53:02,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:02,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:02,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233472945] [2020-02-10 20:53:02,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:02,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:02,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:02,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:02,052 INFO L87 Difference]: Start difference. First operand 781 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:53:02,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:02,181 INFO L93 Difference]: Finished difference Result 1204 states and 4230 transitions. [2020-02-10 20:53:02,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:02,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:02,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:02,185 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:53:02,185 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:53:02,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:53:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-02-10 20:53:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:53:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 20:53:02,206 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 20:53:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:02,206 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 20:53:02,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 20:53:02,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:02,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:02,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-02-10 20:53:02,208 INFO L427 AbstractCegarLoop]: === Iteration 1310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:02,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:02,208 INFO L82 PathProgramCache]: Analyzing trace with hash -950362079, now seen corresponding path program 1303 times [2020-02-10 20:53:02,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:02,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980400670] [2020-02-10 20:53:02,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:02,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980400670] [2020-02-10 20:53:02,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:02,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:02,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896366760] [2020-02-10 20:53:02,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:02,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:02,523 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 20:53:02,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:02,675 INFO L93 Difference]: Finished difference Result 1190 states and 4203 transitions. [2020-02-10 20:53:02,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:02,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:02,678 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:53:02,678 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:53:02,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:53:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 778. [2020-02-10 20:53:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:53:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-02-10 20:53:02,700 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-02-10 20:53:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:02,700 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-02-10 20:53:02,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-02-10 20:53:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:02,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:02,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-02-10 20:53:02,701 INFO L427 AbstractCegarLoop]: === Iteration 1311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:02,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:02,701 INFO L82 PathProgramCache]: Analyzing trace with hash 660578879, now seen corresponding path program 1304 times [2020-02-10 20:53:02,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:02,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912712635] [2020-02-10 20:53:02,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:03,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912712635] [2020-02-10 20:53:03,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:03,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:03,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837416876] [2020-02-10 20:53:03,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:03,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:03,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:03,029 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:53:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:03,163 INFO L93 Difference]: Finished difference Result 1194 states and 4208 transitions. [2020-02-10 20:53:03,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:03,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:03,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:03,167 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:53:03,167 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:53:03,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:53:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-02-10 20:53:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:53:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:53:03,188 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:53:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:03,189 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:53:03,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:53:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:03,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:03,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-02-10 20:53:03,190 INFO L427 AbstractCegarLoop]: === Iteration 1312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:03,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:03,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1456708345, now seen corresponding path program 1305 times [2020-02-10 20:53:03,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:03,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850144059] [2020-02-10 20:53:03,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:03,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850144059] [2020-02-10 20:53:03,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:03,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:03,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008539265] [2020-02-10 20:53:03,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:03,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:03,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:03,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:03,525 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:53:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:03,663 INFO L93 Difference]: Finished difference Result 1184 states and 4188 transitions. [2020-02-10 20:53:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:03,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:03,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:03,666 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:53:03,666 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:53:03,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:53:03,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 20:53:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:53:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:53:03,687 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:53:03,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:03,687 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:53:03,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:03,688 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:53:03,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:03,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:03,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:03,689 INFO L427 AbstractCegarLoop]: === Iteration 1313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:03,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:03,689 INFO L82 PathProgramCache]: Analyzing trace with hash 692088191, now seen corresponding path program 1306 times [2020-02-10 20:53:03,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:03,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167881708] [2020-02-10 20:53:03,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:04,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167881708] [2020-02-10 20:53:04,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:04,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:04,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376416548] [2020-02-10 20:53:04,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:04,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:04,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:04,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:04,020 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:53:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:04,170 INFO L93 Difference]: Finished difference Result 1183 states and 4184 transitions. [2020-02-10 20:53:04,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:04,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:04,173 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:53:04,173 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:53:04,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:04,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:53:04,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-02-10 20:53:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:53:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:53:04,195 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:53:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:04,195 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:53:04,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:53:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:04,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:04,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-02-10 20:53:04,196 INFO L427 AbstractCegarLoop]: === Iteration 1314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:04,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:04,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1446205241, now seen corresponding path program 1307 times [2020-02-10 20:53:04,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:04,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582040217] [2020-02-10 20:53:04,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:04,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582040217] [2020-02-10 20:53:04,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:04,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:04,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539065765] [2020-02-10 20:53:04,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:04,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:04,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:04,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:04,501 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:53:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:04,639 INFO L93 Difference]: Finished difference Result 1192 states and 4202 transitions. [2020-02-10 20:53:04,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:04,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:04,642 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:53:04,642 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:53:04,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:04,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:53:04,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 20:53:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:53:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:53:04,663 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:53:04,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:04,663 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:53:04,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:53:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:04,664 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:04,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-02-10 20:53:04,664 INFO L427 AbstractCegarLoop]: === Iteration 1315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:04,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:04,664 INFO L82 PathProgramCache]: Analyzing trace with hash -908349663, now seen corresponding path program 1308 times [2020-02-10 20:53:04,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:04,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172703743] [2020-02-10 20:53:04,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:04,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172703743] [2020-02-10 20:53:04,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:04,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:04,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045799469] [2020-02-10 20:53:04,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:04,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:04,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:04,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:04,978 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:53:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:05,115 INFO L93 Difference]: Finished difference Result 1187 states and 4190 transitions. [2020-02-10 20:53:05,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:05,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:05,119 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:53:05,119 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:53:05,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:53:05,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-02-10 20:53:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:53:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-02-10 20:53:05,140 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-02-10 20:53:05,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:05,140 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-02-10 20:53:05,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-02-10 20:53:05,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:05,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:05,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-02-10 20:53:05,141 INFO L427 AbstractCegarLoop]: === Iteration 1316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:05,142 INFO L82 PathProgramCache]: Analyzing trace with hash -624765855, now seen corresponding path program 1309 times [2020-02-10 20:53:05,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:05,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102002883] [2020-02-10 20:53:05,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:05,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102002883] [2020-02-10 20:53:05,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:05,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:05,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643157753] [2020-02-10 20:53:05,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:05,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:05,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:05,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:05,472 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-02-10 20:53:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:05,625 INFO L93 Difference]: Finished difference Result 1186 states and 4193 transitions. [2020-02-10 20:53:05,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:05,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:05,629 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:53:05,629 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:53:05,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:05,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:53:05,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 778. [2020-02-10 20:53:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:53:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3090 transitions. [2020-02-10 20:53:05,650 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3090 transitions. Word has length 25 [2020-02-10 20:53:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:05,650 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3090 transitions. [2020-02-10 20:53:05,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3090 transitions. [2020-02-10 20:53:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:05,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:05,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-02-10 20:53:05,652 INFO L427 AbstractCegarLoop]: === Iteration 1317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:05,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1697851235, now seen corresponding path program 1310 times [2020-02-10 20:53:05,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:05,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084949800] [2020-02-10 20:53:05,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:05,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084949800] [2020-02-10 20:53:05,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:05,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:05,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71154663] [2020-02-10 20:53:05,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:05,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:05,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:05,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:05,983 INFO L87 Difference]: Start difference. First operand 778 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:53:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:06,119 INFO L93 Difference]: Finished difference Result 1188 states and 4194 transitions. [2020-02-10 20:53:06,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:06,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:06,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:06,123 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:53:06,123 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:53:06,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:53:06,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 20:53:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:53:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:53:06,145 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:53:06,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:06,145 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:53:06,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:06,145 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:53:06,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:06,146 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:06,146 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:06,146 INFO L427 AbstractCegarLoop]: === Iteration 1318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:06,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:06,146 INFO L82 PathProgramCache]: Analyzing trace with hash 469325733, now seen corresponding path program 1311 times [2020-02-10 20:53:06,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:06,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628494108] [2020-02-10 20:53:06,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:06,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628494108] [2020-02-10 20:53:06,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:06,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:06,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416379141] [2020-02-10 20:53:06,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:06,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:06,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:06,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:06,478 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:53:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:06,632 INFO L93 Difference]: Finished difference Result 1182 states and 4182 transitions. [2020-02-10 20:53:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:06,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:06,636 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:53:06,636 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:53:06,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:53:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:53:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:53:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:53:06,658 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:53:06,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:06,658 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:53:06,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:53:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:06,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:06,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-02-10 20:53:06,659 INFO L427 AbstractCegarLoop]: === Iteration 1319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:06,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:06,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1676845027, now seen corresponding path program 1312 times [2020-02-10 20:53:06,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:06,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221295837] [2020-02-10 20:53:06,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:06,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-02-10 20:53:06,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221295837] [2020-02-10 20:53:06,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:06,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:06,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326098524] [2020-02-10 20:53:06,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:06,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:06,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:06,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:06,994 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:53:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:07,153 INFO L93 Difference]: Finished difference Result 1181 states and 4178 transitions. [2020-02-10 20:53:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:07,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:07,156 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:53:07,157 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:53:07,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:07,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:53:07,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 20:53:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:53:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-02-10 20:53:07,178 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-02-10 20:53:07,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:07,178 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-02-10 20:53:07,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-02-10 20:53:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:07,179 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:07,179 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:07,180 INFO L427 AbstractCegarLoop]: === Iteration 1320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:07,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:07,180 INFO L82 PathProgramCache]: Analyzing trace with hash 490331941, now seen corresponding path program 1313 times [2020-02-10 20:53:07,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:07,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162149764] [2020-02-10 20:53:07,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:07,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162149764] [2020-02-10 20:53:07,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:07,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:07,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929235263] [2020-02-10 20:53:07,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:07,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:07,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:07,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:07,502 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-02-10 20:53:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:07,637 INFO L93 Difference]: Finished difference Result 1186 states and 4188 transitions. [2020-02-10 20:53:07,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:07,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:07,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:07,641 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:53:07,641 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:53:07,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:07,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:53:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 20:53:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:53:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-02-10 20:53:07,663 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-02-10 20:53:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:07,663 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-02-10 20:53:07,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-02-10 20:53:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:07,664 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:07,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-02-10 20:53:07,664 INFO L427 AbstractCegarLoop]: === Iteration 1321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:07,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:07,664 INFO L82 PathProgramCache]: Analyzing trace with hash -582753439, now seen corresponding path program 1314 times [2020-02-10 20:53:07,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:07,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935007002] [2020-02-10 20:53:07,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:07,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-02-10 20:53:07,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935007002] [2020-02-10 20:53:07,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:07,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:07,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622329795] [2020-02-10 20:53:07,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:07,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:07,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:07,994 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:53:08,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:08,135 INFO L93 Difference]: Finished difference Result 1183 states and 4180 transitions. [2020-02-10 20:53:08,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:08,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:08,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:08,138 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:53:08,138 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:53:08,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:08,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:53:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 773. [2020-02-10 20:53:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:53:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3076 transitions. [2020-02-10 20:53:08,160 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3076 transitions. Word has length 25 [2020-02-10 20:53:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:08,160 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3076 transitions. [2020-02-10 20:53:08,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3076 transitions. [2020-02-10 20:53:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:08,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:08,162 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:08,162 INFO L427 AbstractCegarLoop]: === Iteration 1322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:08,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:08,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1311771327, now seen corresponding path program 1315 times [2020-02-10 20:53:08,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:08,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372207578] [2020-02-10 20:53:08,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:08,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372207578] [2020-02-10 20:53:08,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:08,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:08,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540750763] [2020-02-10 20:53:08,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:08,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:08,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:08,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:08,494 INFO L87 Difference]: Start difference. First operand 773 states and 3076 transitions. Second operand 10 states. [2020-02-10 20:53:08,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:08,628 INFO L93 Difference]: Finished difference Result 1202 states and 4227 transitions. [2020-02-10 20:53:08,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:08,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:08,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:08,631 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:53:08,631 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:53:08,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:53:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 780. [2020-02-10 20:53:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:53:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3092 transitions. [2020-02-10 20:53:08,653 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3092 transitions. Word has length 25 [2020-02-10 20:53:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:08,653 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3092 transitions. [2020-02-10 20:53:08,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3092 transitions. [2020-02-10 20:53:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:08,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:08,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-02-10 20:53:08,655 INFO L427 AbstractCegarLoop]: === Iteration 1323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:08,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1372255011, now seen corresponding path program 1316 times [2020-02-10 20:53:08,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:08,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796446012] [2020-02-10 20:53:08,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:08,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796446012] [2020-02-10 20:53:08,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:08,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:08,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540891678] [2020-02-10 20:53:08,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:08,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:08,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:08,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:08,973 INFO L87 Difference]: Start difference. First operand 780 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:53:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:09,147 INFO L93 Difference]: Finished difference Result 1200 states and 4218 transitions. [2020-02-10 20:53:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:09,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:09,151 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:53:09,151 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:53:09,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:53:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-02-10 20:53:09,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:53:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-02-10 20:53:09,172 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-02-10 20:53:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:09,172 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-02-10 20:53:09,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-02-10 20:53:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:09,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:09,174 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:09,174 INFO L427 AbstractCegarLoop]: === Iteration 1324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:09,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1889104381, now seen corresponding path program 1317 times [2020-02-10 20:53:09,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:09,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935939914] [2020-02-10 20:53:09,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:09,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935939914] [2020-02-10 20:53:09,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:09,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:09,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506571892] [2020-02-10 20:53:09,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:09,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:09,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:09,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:09,489 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-02-10 20:53:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:09,623 INFO L93 Difference]: Finished difference Result 1196 states and 4210 transitions. [2020-02-10 20:53:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:09,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:09,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:09,626 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:53:09,626 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:53:09,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:53:09,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-02-10 20:53:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:53:09,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-02-10 20:53:09,648 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-02-10 20:53:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:09,648 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-02-10 20:53:09,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-02-10 20:53:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:09,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:09,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-02-10 20:53:09,650 INFO L427 AbstractCegarLoop]: === Iteration 1325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:09,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:09,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1351248803, now seen corresponding path program 1318 times [2020-02-10 20:53:09,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:09,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430227017] [2020-02-10 20:53:09,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:09,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430227017] [2020-02-10 20:53:09,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:09,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:09,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187312548] [2020-02-10 20:53:09,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:09,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:09,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:09,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:09,965 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:53:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:10,102 INFO L93 Difference]: Finished difference Result 1191 states and 4198 transitions. [2020-02-10 20:53:10,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:10,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:10,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:10,105 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:53:10,105 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:53:10,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:53:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 20:53:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:53:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3079 transitions. [2020-02-10 20:53:10,127 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3079 transitions. Word has length 25 [2020-02-10 20:53:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:10,128 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3079 transitions. [2020-02-10 20:53:10,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3079 transitions. [2020-02-10 20:53:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:10,129 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:10,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-02-10 20:53:10,129 INFO L427 AbstractCegarLoop]: === Iteration 1326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:10,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1878601277, now seen corresponding path program 1319 times [2020-02-10 20:53:10,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:10,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743445642] [2020-02-10 20:53:10,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:10,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743445642] [2020-02-10 20:53:10,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:10,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:10,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382737535] [2020-02-10 20:53:10,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:10,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:10,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:10,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:10,454 INFO L87 Difference]: Start difference. First operand 775 states and 3079 transitions. Second operand 10 states. [2020-02-10 20:53:10,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:10,594 INFO L93 Difference]: Finished difference Result 1192 states and 4200 transitions. [2020-02-10 20:53:10,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:10,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:10,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:10,597 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:53:10,598 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:53:10,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:10,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:53:10,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 20:53:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:53:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3082 transitions. [2020-02-10 20:53:10,620 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3082 transitions. Word has length 25 [2020-02-10 20:53:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:10,620 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3082 transitions. [2020-02-10 20:53:10,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3082 transitions. [2020-02-10 20:53:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:10,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53: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-02-10 20:53:10,621 INFO L427 AbstractCegarLoop]: === Iteration 1327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:10,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:10,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1343280639, now seen corresponding path program 1320 times [2020-02-10 20:53:10,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:10,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353033957] [2020-02-10 20:53:10,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:10,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353033957] [2020-02-10 20:53:10,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:10,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:10,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710563474] [2020-02-10 20:53:10,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:10,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:10,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:10,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:10,949 INFO L87 Difference]: Start difference. First operand 777 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:53:11,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:11,093 INFO L93 Difference]: Finished difference Result 1189 states and 4192 transitions. [2020-02-10 20:53:11,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:11,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:11,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:11,096 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:53:11,096 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:53:11,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:53:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 769. [2020-02-10 20:53:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 20:53:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3068 transitions. [2020-02-10 20:53:11,118 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3068 transitions. Word has length 25 [2020-02-10 20:53:11,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:11,118 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3068 transitions. [2020-02-10 20:53:11,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3068 transitions. [2020-02-10 20:53:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:11,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:11,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-02-10 20:53:11,120 INFO L427 AbstractCegarLoop]: === Iteration 1328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:11,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:11,120 INFO L82 PathProgramCache]: Analyzing trace with hash -984451491, now seen corresponding path program 1321 times [2020-02-10 20:53:11,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:11,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367585687] [2020-02-10 20:53:11,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:11,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367585687] [2020-02-10 20:53:11,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:11,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:11,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563214718] [2020-02-10 20:53:11,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:11,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:11,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:11,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:11,463 INFO L87 Difference]: Start difference. First operand 769 states and 3068 transitions. Second operand 10 states. [2020-02-10 20:53:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:11,613 INFO L93 Difference]: Finished difference Result 1226 states and 4316 transitions. [2020-02-10 20:53:11,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:11,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:11,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:11,616 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:53:11,616 INFO L226 Difference]: Without dead ends: 1211 [2020-02-10 20:53:11,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2020-02-10 20:53:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 780. [2020-02-10 20:53:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:53:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3109 transitions. [2020-02-10 20:53:11,639 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3109 transitions. Word has length 25 [2020-02-10 20:53:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:11,639 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3109 transitions. [2020-02-10 20:53:11,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3109 transitions. [2020-02-10 20:53:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:11,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:11,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:11,640 INFO L427 AbstractCegarLoop]: === Iteration 1329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:11,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:11,640 INFO L82 PathProgramCache]: Analyzing trace with hash 626489467, now seen corresponding path program 1322 times [2020-02-10 20:53:11,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:11,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835393160] [2020-02-10 20:53:11,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:11,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835393160] [2020-02-10 20:53:11,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:11,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:11,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076182096] [2020-02-10 20:53:11,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:11,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:11,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:11,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:11,989 INFO L87 Difference]: Start difference. First operand 780 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:53:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:12,125 INFO L93 Difference]: Finished difference Result 1223 states and 4307 transitions. [2020-02-10 20:53:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:12,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:12,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:12,128 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 20:53:12,128 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 20:53:12,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:12,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 20:53:12,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 777. [2020-02-10 20:53:12,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:53:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-02-10 20:53:12,150 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-02-10 20:53:12,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:12,150 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-02-10 20:53:12,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-02-10 20:53:12,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:12,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:12,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:12,151 INFO L427 AbstractCegarLoop]: === Iteration 1330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:12,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:12,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1710077951, now seen corresponding path program 1323 times [2020-02-10 20:53:12,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:12,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042016871] [2020-02-10 20:53:12,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:12,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042016871] [2020-02-10 20:53:12,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:12,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:12,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954221896] [2020-02-10 20:53:12,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:12,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:12,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:12,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:12,514 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:53:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:12,679 INFO L93 Difference]: Finished difference Result 1233 states and 4330 transitions. [2020-02-10 20:53:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:12,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:12,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:12,683 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 20:53:12,683 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 20:53:12,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:12,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 20:53:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 783. [2020-02-10 20:53:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:53:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-02-10 20:53:12,706 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-02-10 20:53:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:12,706 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-02-10 20:53:12,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-02-10 20:53:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:12,707 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:12,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-02-10 20:53:12,707 INFO L427 AbstractCegarLoop]: === Iteration 1331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:12,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash 636992571, now seen corresponding path program 1324 times [2020-02-10 20:53:12,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:12,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108091851] [2020-02-10 20:53:12,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:13,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:13,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108091851] [2020-02-10 20:53:13,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:13,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:13,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337610181] [2020-02-10 20:53:13,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:13,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:13,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:13,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:13,058 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:53:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:13,193 INFO L93 Difference]: Finished difference Result 1234 states and 4326 transitions. [2020-02-10 20:53:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:13,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:13,196 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 20:53:13,196 INFO L226 Difference]: Without dead ends: 1212 [2020-02-10 20:53:13,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:13,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-02-10 20:53:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 777. [2020-02-10 20:53:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:53:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 20:53:13,218 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 20:53:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:13,218 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 20:53:13,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 20:53:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:13,219 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:13,219 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:53:13,219 INFO L427 AbstractCegarLoop]: === Iteration 1332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:13,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:13,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1720581055, now seen corresponding path program 1325 times [2020-02-10 20:53:13,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:13,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762601135] [2020-02-10 20:53:13,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:13,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762601135] [2020-02-10 20:53:13,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:13,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:13,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639579503] [2020-02-10 20:53:13,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:13,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:13,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:13,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:13,566 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:53:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:13,700 INFO L93 Difference]: Finished difference Result 1224 states and 4306 transitions. [2020-02-10 20:53:13,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:13,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:13,703 INFO L225 Difference]: With dead ends: 1224 [2020-02-10 20:53:13,703 INFO L226 Difference]: Without dead ends: 1212 [2020-02-10 20:53:13,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-02-10 20:53:13,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 780. [2020-02-10 20:53:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:53:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-02-10 20:53:13,725 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-02-10 20:53:13,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:13,725 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-02-10 20:53:13,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-02-10 20:53:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:13,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:13,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-02-10 20:53:13,726 INFO L427 AbstractCegarLoop]: === Iteration 1333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:13,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:13,726 INFO L82 PathProgramCache]: Analyzing trace with hash -963445283, now seen corresponding path program 1326 times [2020-02-10 20:53:13,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:13,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342931724] [2020-02-10 20:53:13,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:14,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342931724] [2020-02-10 20:53:14,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:14,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:14,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326898730] [2020-02-10 20:53:14,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:14,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:14,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:14,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:14,071 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:53:14,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:14,190 INFO L93 Difference]: Finished difference Result 1228 states and 4311 transitions. [2020-02-10 20:53:14,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:14,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:14,193 INFO L225 Difference]: With dead ends: 1228 [2020-02-10 20:53:14,194 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 20:53:14,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 20:53:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 774. [2020-02-10 20:53:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:53:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3090 transitions. [2020-02-10 20:53:14,216 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3090 transitions. Word has length 25 [2020-02-10 20:53:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:14,216 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3090 transitions. [2020-02-10 20:53:14,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3090 transitions. [2020-02-10 20:53:14,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:14,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:14,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-02-10 20:53:14,217 INFO L427 AbstractCegarLoop]: === Iteration 1334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:14,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:14,217 INFO L82 PathProgramCache]: Analyzing trace with hash 941582587, now seen corresponding path program 1327 times [2020-02-10 20:53:14,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:14,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757270768] [2020-02-10 20:53:14,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:53:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:53:14,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757270768] [2020-02-10 20:53:14,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:53:14,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:53:14,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760213443] [2020-02-10 20:53:14,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:53:14,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:53:14,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:53:14,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:53:14,561 INFO L87 Difference]: Start difference. First operand 774 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:53:14,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:53:14,688 INFO L93 Difference]: Finished difference Result 1223 states and 4306 transitions. [2020-02-10 20:53:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:53:14,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:53:14,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:53:14,691 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 20:53:14,691 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 20:53:14,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:53:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 20:53:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 780. [2020-02-10 20:53:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:53:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3106 transitions. [2020-02-10 20:53:14,713 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3106 transitions. Word has length 25 [2020-02-10 20:53:14,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:53:14,714 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3106 transitions. [2020-02-10 20:53:14,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:53:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3106 transitions. [2020-02-10 20:53:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:53:14,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:53:14,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-02-10 20:53:14,715 INFO L427 AbstractCegarLoop]: === Iteration 1335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:53:14,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:53:14,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1742443751, now seen corresponding path program 1328 times [2020-02-10 20:53:14,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:53:14,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720322826] [2020-02-10 20:53:14,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:53:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2020-02-10 20:53:14,779 WARN L209 SmtUtils]: Removed 4 from assertion stack [2020-02-10 20:53:14,780 WARN L544 AbstractCegarLoop]: Verification canceled [2020-02-10 20:53:14,783 WARN L227 ceAbstractionStarter]: Timeout [2020-02-10 20:53:14,783 INFO L202 PluginConnector]: Adding new model example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:53:14 BasicIcfg [2020-02-10 20:53:14,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:53:14,784 INFO L168 Benchmark]: Toolchain (without parser) took 768295.66 ms. Allocated memory was 144.2 MB in the beginning and 1.1 GB in the end (delta: 948.4 MB). Free memory was 119.3 MB in the beginning and 455.2 MB in the end (delta: -335.8 MB). Peak memory consumption was 612.6 MB. Max. memory is 7.1 GB. [2020-02-10 20:53:14,784 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.31 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 20:53:14,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.79 ms. Allocated memory is still 144.2 MB. Free memory was 119.1 MB in the beginning and 117.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-02-10 20:53:14,785 INFO L168 Benchmark]: Boogie Preprocessor took 23.17 ms. Allocated memory is still 144.2 MB. Free memory was 117.4 MB in the beginning and 116.3 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. [2020-02-10 20:53:14,785 INFO L168 Benchmark]: RCFGBuilder took 332.58 ms. Allocated memory is still 144.2 MB. Free memory was 116.1 MB in the beginning and 102.8 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2020-02-10 20:53:14,785 INFO L168 Benchmark]: TraceAbstraction took 767895.75 ms. Allocated memory was 144.2 MB in the beginning and 1.1 GB in the end (delta: 948.4 MB). Free memory was 102.4 MB in the beginning and 455.2 MB in the end (delta: -352.8 MB). Peak memory consumption was 595.7 MB. Max. memory is 7.1 GB. [2020-02-10 20:53:14,786 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 1.31 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.4 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 36.79 ms. Allocated memory is still 144.2 MB. Free memory was 119.1 MB in the beginning and 117.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.17 ms. Allocated memory is still 144.2 MB. Free memory was 117.4 MB in the beginning and 116.3 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 332.58 ms. Allocated memory is still 144.2 MB. Free memory was 116.1 MB in the beginning and 102.8 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 767895.75 ms. Allocated memory was 144.2 MB in the beginning and 1.1 GB in the end (delta: 948.4 MB). Free memory was 102.4 MB in the beginning and 455.2 MB in the end (delta: -352.8 MB). Peak memory consumption was 595.7 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, 59 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 19 for 27ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 767.6s, OverallIterations: 1335, TraceHistogramMax: 1, AutomataDifference: 206.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 119436 SDtfs, 176477 SDslu, 305124 SDs, 0 SdLazy, 91001 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 87.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13291 GetRequests, 1341 SyntacticMatches, 0 SemanticMatches, 11950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7962 ImplicationChecksByTransitivity, 579.8s 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: 33.9s AutomataMinimizationTime, 1334 MinimizatonAttempts, 697476 StatesRemovedByMinimization, 1327 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 513.3s InterpolantComputationTime, 33350 NumberOfCodeBlocks, 33350 NumberOfCodeBlocksAsserted, 1334 NumberOfCheckSat, 32016 ConstructedInterpolants, 0 QuantifiedInterpolants, 22360224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1334 InterpolantComputations, 1334 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